Sort function descending c++

How to sort in descending order c++

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

C++ descending sort

sort(arr, arr + n, greater<int>());

Sort function descending c++

// C++ program to demonstrate descending order sort using
// greater<>().
#include <bits/stdc++.h>
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, greater<int>());
 
    cout << "Array after sorting : \n";
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
 
    return 0;
}

Source: geeksforgeeks.org

Descending order c++

sort(begin(arr), end(arr), greater<>())

Source: techiedelight.com

Similar codes

5 votes115 views4 answers
Split pdf
C++
0 vote145 views2 answers
Dynamic memory allocation c++
C++
1 vote99 views1 answer
Mpi_bcast
C++
1 vote122 views2 answers
Maximum value in map in c++
C++
0 vote114 views6 answers
Gcd
C++
3 votes99 views2 answers
Prints out the elements in the array c++
C++
0 vote106 views1 answer
Prime template c++
C++
0 vote101 views1 answer
Intlen in c++
C++
0 vote113 views1 answer
C++ find with predicat
C++
0 vote116 views1 answer
C++ compile to exe
C++