Quick Sort

The key process in quickSort is partition(). It takes smaller elements than pivot before pivot and greater elements after pivot.

Merge Sort

It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.

Quick sort and Merge sort known as divide and conquer algorithm paradigm. Divide means break the problem into some subproblem, while conquer means recursively solves these subproblems.