stl sort in c 2b 2b

1
2// STL IN C++ FOR SORING
3#include <bits/stdc++.h> 
4#include <iostream> 
5using namespace std; 
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    sort(arr, arr+n);  // ASCENDING SORT
11    reverse(arr,arr+n);   //REVERESE ARRAY 
12    sort(arr, arr + n, greater<int>());// DESCENDING SORT
13  } 

1 int arr[]= {2,3,5,6,1,2,3,6,10,100,200,0,-10};
2    int n = sizeof(arr)/sizeof(int);  
3    sort(arr,arr+n);
4
5    for(int i: arr)
6    {
7        cout << i << " ";
8    }
9

1sort(arr, arr+n); // sorts in ascending order

1sort(arr, arr+n, greater<int>()); // sorts in descending order

1#include <algorithm>    // std::sort
2
3int myints[] = {32,71,12,45,26,80,53,33};
4// using default comparison (operator <):
5std::sort (myvector.begin(), myvector.begin()+4);           //(12 32 45 71)26 80 53 33
6
7// fun returns some form of a<b
8std::sort (myvector.begin()+4, myvector.end(), myfunction); // 12 32 45 71(26 33 53 80)

1std::vector s = {5, 1, 3, 6, 2,};
2std::sort(s.begin(), s.end());