/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 vote311 views1 answer
Factore of 20 in c+
C++
0 vote277 views1 answer
How to read qlistwidget in c++
C++
1 vote248 views1 answer
C++ vs g++
C++
9 votes282 views3 answers
Log base c++
C++
1 vote257 views1 answer
Building native binary with il2cpp unity
C++
1 vote229 views1 answer
How to print fixed places after decimal point in c++
C++
0 vote252 views1 answer
Inheritance example in C plus plus
C++
0 vote274 views1 answer
C++ sorting and keeping track of indexes
C++
4 votes238 views1 answer
Cin statement c++
C++
1 vote275 views1 answer
How to return char* from function in c++
C++