/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

1 vote345 views1 answer
Sieve of eresthossis cp c++
C++
0 vote323 views1 answer
How to create a min priority queue of pair of int, int
C++
1 vote389 views1 answer
Stack implementation using linked list in cpp
C++
10 votes308 views3 answers
Conditional operator in c++
C++
-1 vote334 views1 answer
Istream c++
C++
0 vote419 views1 answer
How to convert int to FString c++ ue4
C++
3 votes322 views3 answers
C++ colored output
C++
2 votes328 views2 answers
What is typedef
C++
0 vote350 views1 answer
Codeforces Pangram in c++
C++
10 votes313 views1 answer
How to append one vector to another c++
C++