Skip to content

Sorting

Problem Complexity Key Pattern
Merge Sort Inversions O(n log n) Counting disorder in sequences — "number of inversions", "how far
Quickselect O(n) average, O(n^2) worst case Selection without full sort — "kth smallest/largest", "median",