Container-based version of the <algorithm> std::partial_sort() function to rearrange elements within a container such that elements before middle are sorted in ascending order.
Declared in <absl/algorithm/container.h>
template<typename RandomAccessContainer>
constexpr
void
c_partial_sort(
RandomAccessContainer& sequence,
/* implementation-defined */ middle);| Name | Description |
|---|---|
| sequence | The container to partially sort. |
| middle | An iterator to the end of the range to be sorted. |