Sorting is the most studied family of algorithms. Comparison sorts (quicksort, mergesort, heapsort) have an O(n log n) lower bound. Non-comparison sorts (counting, radix, bucket) beat this for constrained inputs. Stability, in-place operation, cache friendliness, and parallelizability all matter in practice.
The 5-Mode Loop
5 of 5 modes available
Read · See · Animate · Test · Build