/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 vote341 views1 answer
Rotate an array of n elements to the right by k steps
C++
0 vote343 views1 answer
C++ find index of all occurrences in string
C++
1 vote341 views1 answer
Array sum in c++ stl
C++
9 votes321 views3 answers
C++ throw exception
C++
1 vote319 views1 answer
Cpp map iterate over keys
C++
0 vote338 views1 answer
Hpp files
C++
-1 vote312 views1 answer
How to rename a file in cpp
C++
-5 votes312 views3 answers
Array syntax in c++
C++
0 vote357 views1 answer
Find with hash set
C++
0 vote303 views1 answer
Delay without blocking
C++