Merge sort

Related terms

• Quicksort — Pick a pivot, partition the slice around it, then sort both sides recursively; O(n log n) on average, in place.
• Heap sort — Build a max-heap in place, then repeatedly swap the root to the end and sift down; O(n log n), no extra memory, not stable.
• Stable sort — A sort that keeps equal elements in their original relative order.
• Big-O — An upper bound on how an algorithm's cost grows with input size n, ignoring constants and lower-order terms.

← All terms