Check out example codes for "sort in descending order c++ stl". It will help you in understanding the concepts better.

Code Example 1

``````// C++ program to demonstrate default behaviour of
// sort() in STL.
#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);

cout << "\nArray after sorting using "
"default sort is : \n";
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";

return 0;
}``````

Code Example 2

``````// A C++ program to demonstrate STL sort() using
// our own comparator
#include<bits/stdc++.h>
using namespace std;

// An interval has a start time and end time
struct Interval
{
int start, end;
};

// Compares two intervals according to staring times.
bool compareInterval(Interval i1, Interval i2)
{
return (i1.start < i2.start);
}

int main()
{
Interval arr[] =  { {6,8}, {1,9}, {2,4}, {4,7} };
int n = sizeof(arr)/sizeof(arr[0]);

// sort the intervals in increasing order of
// start time
sort(arr, arr+n, compareInterval);

cout << "Intervals sorted by start time : \n";
for (int i=0; i<n; i++)
cout << "[" << arr[i].start << "," << arr[i].end
<< "] ";

return 0;
}``````

Code Example 3

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

Code Example 4

``````sort(arr, arr+n);
sort(arr, arr+n, greater<int>()); // In Descending Order``````

Code Example 5

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

Learn ReactJs, React Native from akashmittal.com