qselect

Select the k-th smallest out of n numbers.

Finds the k-th smallest from a list of n numbers. Based on Hoare's Quickselect algorithm with the median of three pivot strategy.
See https://en.wikipedia.org/wiki/Quickselect for details.

The k-th *largest* element can be found by passing n+1-k