/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 vote130 views1 answer
Hash Sort in C++
C++
1 vote217 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
0 vote132 views1 answer
Ejemplo
C++
1 vote123 views1 answer
C++ lock
C++
0 vote137 views1 answer
Ue_log example
C++
2 votes144 views1 answer
Qt get hexa value from qstring
C++
7 votes467 views5 answers
Stoi cpp
C++
0 vote127 views1 answer
Why we use iostream in C++ programming
C++
11 votes126 views2 answers
C++ main function
C++
2 votes144 views1 answer
Variable vs pointer in c++
C++