Are you sure you're getting this? Fill in the missing part by typing it in.

QuickSort is a __-based algorithm that follows the divide-and-conquer approach. It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.

MergeSort is also a __-based algorithm that follows the divide-and-conquer approach. It works by recursively dividing the array into two halves, sorting each half separately, and then merging the two sorted halves.