sort vector c++
//me vector<int> v{2,5,3,4,0,1}; sort( v.begin(), v.end() ); //v is now {0,1,2,3,4,5}
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);
c++ sort vector
// C++ program to sort a vector in non-decreasing // order. #include <bits/stdc++.h> using namespace std; int main() { vector<int> v{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; sort(v.begin(), v.end()); return 0; }
Source: www.geeksforgeeks.org
sort vector c++
sort(begin(v), end(v), [] (int a, int b) { return a > b; }); // decrease
sort a vector c++
sort(a.begin(), a.end());