c++ vector sort reverse code example
Example 1: c++ reverse vector
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
vector<int> nums{4,1,2,1,2};
reverse(nums.begin(), nums.end());
return 0;
}
Example 2: how to sort a vector in reverse c++
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v = { 10, 9, 8, 6, 7, 2, 5, 1 };
sort(v.begin(), v.end(), greater <>());
}
Example 3: sort vector descending
int main()
{
vector<int> a = { 1, 45, 54, 71, 76, 12 };
cout << "Vector: ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
sort(a.begin(), a.end(), greater<int>());
cout << "Sorted Vector in descendiing order:n";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
return 0;
}