Concept

Quickselect — where it appears

A selection algorithm that partitions around a pivot as quicksort does but continues only into the side holding the rank it wants. With random pivots it finds the element of a given rank in a linear number of comparisons on average, without sorting the rest.

Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.

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

All concepts