/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 vote110 views1 answer
Heap allocated array in c ++
C++
0 vote104 views1 answer
C++ compile to exe
C++
1 vote108 views2 answers
Struct constructor in c++
C++
0 vote95 views1 answer
How initilaize deffult value to c++ class
C++
1 vote97 views1 answer
What is time complexity of min_element()
C++
0 vote125 views1 answer
Grep xargs sed
C++
1 vote137 views1 answer
'std::ifstream file' has initializer but incomplete type
C++
7 votes103 views2 answers
Round c++
C++
1 vote93 views3 answers
Type casting in cpp
C++
0 vote95 views1 answer
Landscape overleaf
C++