Selector
An implementation of a selection algorithm, ie. computing the k-th greatest value from a collection.
Inheritors
Functions
Link copied to clipboard
Reorder elements so that the element at position k is the same as if all elements were sorted and all other elements are partitioned around it: [from, k) only contains elements that are less than or equal to k and (k, to) only contains elements that are greater than or equal to k.