/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 vote172 views1 answer
At c++ vector
C++
0 vote165 views1 answer
Why return 0 in int main
C++
1 vote202 views1 answer
Qt remove resize handle
C++
0 vote162 views1 answer
How to store pair in min heap in c++
C++
1 vote188 views1 answer
Check if double is integer c++
C++
0 vote162 views1 answer
How to refresh multiple command lines in C++ stream
C++
0 vote177 views5 answers
Run time calculator c++
C++
0 vote212 views1 answer
Foo foo little dogs
C++
-1 vote131 views1 answer
C++ to mips assembly converter
C++
1 vote159 views3 answers
Return use in c++
C++