Back

The std::nth_element is a partitioning algorithm with linear complexity that reorders the elements of the given range so that the element under the pivot iterator is the element that would be there if the range were sorted.

The algorithm does have a significant constant overhead, making std::partial_sort potentially faster for extreme percentiles and short ranges.

Compiler Explorer link: https://compiler-explorer.com/z/zzoPoz4nh