stdpartial_sort(3)
std::partial_sort - std::partial_sort
Synopsis
Defined in header<algorithm>
template <class RandomIt>
(until C++ 20)
void partial_sort(RandomIt first, RandomIt middle, RandomIt last);
template <class RandomIt>
(since C++ 20)
constexpr void partial_sort(RandomIt first, RandomIt middle, RandomIt last);
template <class ExecutionPolicy, class RandomIt>
void partial_sort(ExecutionPolicy &&policy, (2)(since C++ 17)
RandomIt first,
RandomIt middle, RandomIt last);
template <class RandomIt, class Compare>
void partial_sort(RandomIt first, RandomIt middle, RandomIt last, (1)(until C++ 20)
Compare comp);
template <class RandomIt, class Compare>
constexpr void partial_sort(RandomIt first, RandomIt middle, RandomIt last, (3)(since C++ 20)
Compare comp);
template <class ExecutionPolicy, class RandomIt, class Compare>
void partial_sort(ExecutionPolicy &&policy, (4)(since C++ 17)
RandomIt first,
RandomIt middle, RandomIt last,
Compare comp);Rearranges elements such that the range [first, middle) contains the sorted middle - first smallest elements in the range [first, last). The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range [middle, last) is unspecified.
- Elements are compared using operator<.
- Elements are compared using the given binary comparison function comp. 2,4) Same as (1,3), but executed according to policy. These overloads do not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true
Parameters
first, last - the range of elements to sort
policy - the execution policy to use. See execution_policy for details.
Type requirements
RandomIt must meet the requirements of ValueSwappable and LegacyRandomAccessIterator.
The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
Return value
(none)
Complexity
Approximately (last-first)log(middle-first) applications of cmp
Exceptions
The overloads with a template parameter named ExecutionPolicy report errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard_policies, std::terminate is called. For any other ExecutionPolicy, the behavior is implementation-defined.
- If the algorithm fails to allocate memory, std::bad_alloc is thrown.
Example
// Run this code
#include <algorithm>
#include <functional>
#include <array>
#include <iostream>
int main()
{
std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
std::partial_sort(s.begin(), s.begin() + 3, s.end());
for (int a : s) {
std::cout << a << " ";
}
}
Possible output:
See also