[C++] sort 이용한 오름차순, 내림차순 정렬, greater<>, less<>

sort() - 기본 오름차순

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    vector<int> v = {3, 2, 0, 9, 7, 1, 4, 8, 6};
    sort(v.begin(), v.end());
    for (int n : v) {
        cout << n << ' ';
    }
    cout << '\n';
    return 0;
}

// 0 1 2 3 4 6 7 8 9

sort() + std::less<> - 오름차순

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    vector<int> v = {3, 2, 0, 9, 7, 1, 4, 8, 6};
    sort(v.begin(), v.end(), less<int>());
    for (int n : v) {
        cout << n << ' ';
    }
    cout << '\n';
    return 0;
}

// 0 1 2 3 4 6 7 8 9 

sort() + std::greater<> - 내림차순

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    vector<int> v = {3, 2, 0, 9, 7, 1, 4, 8, 6};
    sort(v.begin(), v.end(), greater<int>());
    for (int n : v) {
        cout << n << ' ';
    }
    cout << '\n';
    return 0;
}

// 9 8 7 6 4 3 2 1 0