Both merge sort and quicksort use divide and conquer technique. Merge sort uses extra space O(n) for storage of sub-array, while quicksort doesn't. Merge sort is more stable than quicksort.