// STL IN C++ FOR SORING
#include <bits/stdc++.h>
#include <iostream>
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); // ASCENDING SORT
reverse(arr,arr+n); //REVERESE ARRAY
sort(arr, arr + n, greater<int>());// DESCENDING SORT
}