Quickselect — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
What derandomising costs
Randomised selection finds the median of twenty thousand elements in 3.21 comparisons per element and median-of-medians takes 8.15 — two and a half times as many for the same answer, both linear. The number that decides between them is not either of those. It is that the first varies by 28% from seed to seed and the second by 1.6%.
The count of the part that was read
Handing back the smallest ten of 65,536 keys in order costs 965,656 comparisons by sorting them and 65,670 by a knockout tournament, against a floor of 65,526. Read to the last element, the same tournament makes exactly merge sort's 965,656 — it is merge sort, charged one element at a time. A sort's count has no term for how much of its answer anyone reads, and the two floors that do have one cannot simply be added.
Named alongside it
The objects these essays reach for when they reach for this one.
Randomised algorithmWorst caseComparison countDerandomisationDistributionGuaranteeHeapInformation floorLower boundMedian of mediansMerge sortOutput-sensitive