std::stable_sort (3) - Linux Man Pages
Defined in header <algorithm>
template< class RandomIt > (1)
void stable_sort( RandomIt first, RandomIt last );
template< class ExecutionPolicy, class RandomIt > (2) (since C++17)
void stable_sort( ExecutionPolicy&& policy, RandomIt first, RandomIt last );
template< class RandomIt, class Compare > (3)
void stable_sort( RandomIt first, RandomIt last, Compare comp );
template< class ExecutionPolicy, class RandomIt, class Compare > (4) (since C++17)
void stable_sort( ExecutionPolicy&& policy, RandomIt first, RandomIt last, Compare comp );
Sorts the elements in the range [first, last) in ascending order. The order of equivalent elements is guaranteed to be preserved.
1) Elements are compared using operator<.
3) Elements are compared using the given 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
first, last - the range of elements to sort
policy - the execution policy to use. See execution_policy for details.
comp - While the signature does not need to have const &, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value_category (thus, Type1 & is not allowed
RandomIt must meet the requirements of ValueSwappable and LegacyRandomAccessIterator.
The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
O(N·log(N)2), where N = std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N)).
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.
This function attempts to allocate a temporary buffer equal in size to the sequence to be sorted. If the allocation fails, the less efficient algorithm is chosen.
// Run this code