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 in descending order c++
int arr[10]; int length = sizeof(arr)/sizeof(arr[0]); sort(arr, arr+length, greater<int>());
sort vector struct c++
struct data{ string word; int number; }; bool my_cmp(const data& a, const data& b) { // smallest comes first return a.number < b.number; } std::sort(A.begin(), A.end(), my_cmp);
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; }
sort vector in descending order c++
1325995623