sort reverse c++ code example

Example 1: 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 <>());
}

Example 2: how to sort in descending order c++

int arr[10];
int length = sizeof(arr)/sizeof(arr[0]); 
sort(arr, arr+length, greater<int>());

Example 3: stl for sorting IN C++

// STL IN C++ FOR SORING
#include <bits/stdc++.h> 
#include <iostream> 
using namespace std; 
int main() 
{ 
    int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0}; 
    int n = sizeof(arr)/sizeof(arr[0]); 
    sort(arr, arr+n);  // ASCENDING SORT
    reverse(arr,arr+n);   //REVERESE ARRAY 
    sort(arr, arr + n, greater<int>());// DESCENDING SORT
  }

Example 4: how to sort in descending order in c++

sort(str.begin(), str.end(), greater<int>());
cout<<str;

Example 5: reverse iterator c++

// A reverse_iterator example using vectors

#include <iostream>
#include <vector>

int main() {
	std::vector<int> vec = {1, 2, 3, 4, 5};
  	std::vector<int>::reverse_iterator r_iter;
  
    // rbegin() points to the end of the vector, and rend()
    // points to the front. Use crbegin() and crend() for
  	// the const versions of these interators.
    for (r_iter = vec.rbegin(); r_iter != vec.rend(); r_iter++) {
        std::cout << *r_iter << std::endl;
    }
  	
  	return 0;
}