sort vector in descending order
#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 <>());
}
0
0
int main()
{
// Get the vector
vector<int> a = { 1, 45, 54, 71, 76, 12 };
// Print the vector
cout << "Vector: ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
// Sort the vector in descending order
sort(a.begin(), a.end(), greater<int>());
// Print the reversed vector
cout << "Sorted Vector in descendiing order:n";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
return 0;
}
Thank you!
0
0
0
5
sort(a.begin(), a.end(), greater<int>());
Thank you!
5
0
Are there any code examples left?
New code examples in category C++