1
2int main(){
3 int arr[5] = {1,3,2,4,5};
4 sort(arr, arr+5, greater<int>());
5 // arr == {5,4,3,2,1}
6 return 0;
7}
8
1// C++ program to demonstrate default behaviour of
2// sort() in STL.
3#include <bits/stdc++.h>
4using namespace std;
5
6int main()
7{
8 int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0};
9 int n = sizeof(arr)/sizeof(arr[0]);
10
11 sort(arr, arr+n);
12
13 cout << "\nArray after sorting using "
14 "default sort is : \n";
15 for (int i = 0; i < n; ++i)
16 cout << arr[i] << " ";
17
18 return 0;
19}
1#include <bits/stdc++.h>
2using namespace std;
3
4#define size(arr) sizeof(arr)/sizeof(arr[0]);
5
6
7int main(){
8
9 int a[5] = {5, 2, 6,3 ,5};
10 int n = size(a);
11 sort((a), a + n);
12 for(int i = 0; i < n; i++){
13 cout << a[i];
14 }
15
16
17 return 0;
18
19}