/C++/How to sort a vector in reverse c++

How to sort a vector in reverse c++

C++ reverse vector

#include <bits/stdc++.h> // Vector
#include <algorithm>  // Reverse 
using namespace std;

int main()
{
    vector<int> nums{4,1,2,1,2};

    reverse(nums.begin(), nums.end());
    return 0;
}

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: tutorialspoint.com

Similar codes

0 vote224 views2 answers
C++ map key exists
C++
1 vote184 views1 answer
Qt qchar to char
C++
7 votes226 views6 answers
Iterate through map
C++
0 vote199 views1 answer
C++ print to standard error
C++
1 vote174 views1 answer
Get the element at an index list c++
C++
0 vote190 views1 answer
Clean list widget qt
C++
0 vote183 views1 answer
Convert string to wide string
C++
-2 votes192 views1 answer
X += c++
C++
0 vote189 views1 answer
Define type c++
C++
3 votes247 views3 answers
C++ string contains
C++