Example 1: stl for sorting IN C++
// STL IN C++ FOR SORING
#include
#include
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());// DESCENDING SORT
}
Example 2: c++ sort
int arr[]= {2,3,5,6,1,2,3,6,10,100,200,0,-10};
int n = sizeof(arr)/sizeof(int);
sort(arr,arr+n);
for(int i: arr)
{
cout << i << " ";
}
Example 3: array sort c++
#include
2 #include
3 #include
4 #include
5
6 using namespace std;
7
8 int main(){
9 array colours = {"blue", "black", "red", "green"};
10 for (string colour : colours){
11 cout << colour << ' ';
12 }
13 cout << endl;
14 sort(colours.begin(), colours.end());
15 for (string colour : colours){
16 cout << colour << ' ';
17 }
18 return 0;
19 }
66
20
21 /*
22 Output:
23 blue black red green
24 black blue green red
25 */
Example 4: c++ sort
#include
vector v = { 6,1,4,5,2,3,0};
sort(v.begin() , v.end()); // {0,1,2,3,4,5,6} sorts ascending
sort(v.begin(), v.end(), greater()); // {6,5,4,3,2,1,0} sorts descending