Tag
quicksort
- Sep 22, 2026 Quicksort Partition Schemes and the Duplicate-Key Quadratic How Lomuto and Hoare partitioning differ in swap count and branch behaviour, why two-way partitions degrade on equal keys, and what three-way partitioning restores. algorithms
- Jun 22, 2026 Introsort: Bounding Quicksort with a Depth Counter and a Heap How a recursion-depth budget converts quicksort into a worst-case n log n algorithm, and why heapsort is the fallback rather than merge sort. algorithms
- Oct 5, 2022 Randomized Quicksort and the Expected Comparison Count How choosing the pivot uniformly at random makes the 2n ln n comparison bound hold for every input, and where the expectation stops describing a single run. algorithms