std::sort

From Cppreference

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.

[edit] Parameters

[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 << std::endl;
 
    std::sort(s.begin(), s.end(), std::greater<int>());
    for (int a : s) {
        std::cout << a << " ";
    } 
 
    return 0;
}​

Output:

​0 1 2 3 4 5 6 7 8 9
9 8 7 6 5 4 3 2 1 0​

[edit] See also