Sorting

Applies to: general

Sorting arranges elements in order. Good general-purpose algorithms (quicksort, mergesort, Timsort) run in O(n log n). In practice you call your language's built-in sort and pass a key/comparator.

nums.sort()                         # ascending, in place
people.sort(key=lambda p: p.age)    # sort by a key

See also: binary-search, big-o