Container‐based version of the <algorithm> std::nth_element() function to rearrange the elements within a container such that the nth element would be in that position in an ordered sequence; other elements may be in any order, except that all preceding nth will be less than that element, and all following nth will be greater than that element.
Synopsis
Declared in <absl/algorithm/container.h>
template<typename RandomAccessContainer>
constexpr
void
c_nth_element(
RandomAccessContainer& sequence,
/* implementation-defined */ nth);
Parameters
Name |
Description |
sequence |
The container to rearrange. |
nth |
An iterator to the element to place in its sorted position. |
Created with MrDocs