std::sort
From Cppreference
| Defined in header <algorithm>
|
||
| template< class RandomAccessIterator >
void sort( RandomAccessIterator first, RandomAccessIterator last ); |
(1) | |
| template< class RandomAccessIterator, class Compare >
void sort( RandomAccessIterator first, RandomAccessIterator last, Compare comp ); |
(2) | |
Sorts the elements in the range [first, last) in ascending order. The order of equal elements is not guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.
Contents |
[edit] Parameters
| first, last | - | the range of elements to sort | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. |
|||||||||
[edit] Return value
(none)
[edit] Complexity
O(N·log(N)), where N = std::distance(first, last) applications of cmp.
[edit] Example
#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::sort(s.begin(), s.end()); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; std::sort(s.begin(), s.end(), std::greater<int>()); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; }
Output:
0 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 0
[edit] See also
|
sorts the first N elements of a range (function template) |
|
|
sorts a range of elements while preserving order between equal elements (function template) |
|