/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 vote347 views1 answer
What does the modularity mean in c++
C++
1 vote249 views1 answer
Can we create array inside an array in c++
C++
1 vote289 views1 answer
Whole size of the internet
C++
1 vote304 views1 answer
Matrix layout in C++
C++
23 votes315 views6 answers
Team fortress
C++
0 vote319 views1 answer
Processing a string- CodeChef Solution in CPP
C++
-1 vote307 views1 answer
How to make a hello world program in c++
C++
1 vote307 views1 answer
Priority queue c++ type of pairs
C++
0 vote300 views1 answer
Finding nth most rare element code in c++
C++
0 vote288 views1 answer
Elements of set c++
C++