QuickSelect → see Quickselect
Scope — Redirect only. This sheet was renamed to quickselect.md in Nov 2026; it exists to point old links at the right sections. See also: quickselect.md — the canonical sheet for partition-based selection.
This sheet is now quickselect.md.
Quickselect is a selection algorithm that happens to use a two-pointer partition, so the
2_pointers_prefix filed it under the wrong topic. The content moved unchanged in substance, rebuilt as pattern cards.
Where things went
| You were looking for | Now in |
|---|---|
| Template 1, the kth largest element | quickselect.md → Template 1: Three-Way Partition Quickselect |
| Template 2, the k closest points | quickselect.md → Template 2: Quickselect on a Derived Key |
| The visual example and the randomized pivot | quickselect.md → Template 1, its dry run and traps |
| Hoare, Lomuto and three-way partitions | quickselect.md → Partition Schemes |
| Median of medians | quickselect.md → Median of Medians — now runnable |
| Other quickselect problems, performance comparison | quickselect.md → Other Problems on the Same Skeleton and Quickselect vs Heap vs Sort |
See also
- quickselect.md — canonical sheet for quickselect
- heap.md — the size-k heap alternative