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 <>()); }
Source: www.tutorialspoint.com
how to sort a vector in descending order in c++
//Method 1 sort(v.begin(),v.end(),greater<>()); //Method 2 //Multiply the vector with -1 and then sort it and again multiply it with -1.
reverse sort a vector
vector<int> v = { 10, 9, 8, 6, 7, 2, 5, 1 }; sort(v.begin(), v.end(), greater <>());
sort vector in reverse order c++
#include <iostream> #include <vector> #include <algorithm> int main() { std::vector<int> vec = { 7, 3, 5, 1, 9 }; std::sort(vec.rbegin(), vec.rend()); // do anything return 0; }