Check out example codes for "reverse sort cpp". It will help you in understanding the concepts better.

Code Example 1

``````int main(){
int arr[5] = {1,3,2,4,5};
sort(arr, arr+5, greater<int>());
// arr == {5,4,3,2,1}
return 0;
}``````

Code Example 2

``````#include <bits/stdc++.h>
using namespace std;

#define size(arr) sizeof(arr)/sizeof(arr[0]);

int main(){

int a[5] = {5, 2, 6,3 ,5};
int n = size(a);
sort((a), a + n);
for(int i = 0; i < n; i++){
cout << a[i];
}

return 0;

}``````

Code Example 3

``````// 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;
}``````

Code Example 4

``````// 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;
}``````

Learn ReactJs, React Native from akashmittal.com