Merge sort: divide array in halves, sort recursively, merge. O(n log n). Quick sort: partition around pivot, recurse on sub-arrays.