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}
20
1#include <iostream>
2using namespace std;
3
4#define MAX 100
5
6int main()
7{
8 //array declaration
9 int arr[MAX];
10 int n,i,j;
11 int temp;
12
13 //read total number of elements to read
14 cout<<"Enter total number of elements to read: ";
15 cin>>n;
16
17 //check bound
18 if(n<0 || n>MAX)
19 {
20 cout<<"Input valid range!!!"<<endl;
21 return -1;
22 }
23
24 //read n elements
25 for(i=0;i<n;i++)
26 {
27 cout<<"Enter element ["<<i+1<<"] ";
28 cin>>arr[i];
29 }
30
31 //print input elements
32 cout<<"Unsorted Array elements:"<<endl;
33 for(i=0;i<n;i++)
34 cout<<arr[i]<<"\t";
35 cout<<endl;
36
37 //sorting - ASCENDING ORDER
38 for(i=0;i<n;i++)
39 {
40 for(j=i+1;j<n;j++)
41 {
42 if(arr[i]>arr[j])
43 {
44 temp =arr[i];
45 arr[i]=arr[j];
46 arr[j]=temp;
47 }
48 }
49 }
50
51 //print sorted array elements
52 cout<<"Sorted (Ascending Order) Array elements:"<<endl;
53 for(i=0;i<n;i++)
54 cout<<arr[i]<<"\t";
55 cout<<endl;
56
57
58 return 0;
59
60}
61
1sort(arr, arr+length); //increase
2sort(arr, arr+length, greater<int>()); //decrease
1#include <algorithm>
2#include <iostream>
3#include <array>
4using namespace std;
5
6int main() {
7 array<int, 5> arraysort{ 4,2,3,5,1 };
8 sort(arraysort.begin(), arraysort.end());
9 for (int i = 0; i < arraysort.size(); i++) {
10 cout << arraysort[i] << " ";
11 }
12 return 0;
13}
1#include<bits/stdc++.h>
2
3vector<int> v = { 6,1,4,5,2,3,0};
4sort(v.begin() , v.end()); // {0,1,2,3,4,5,6} sorts ascending
5sort(v.begin(), v.end(), greater<int>()); // {6,5,4,3,2,1,0} sorts descending
1#include <iostream>
22 #include <array>
33 #include <string>
44 #include <algorithm>
55
66 using namespace std;
77
88 int main(){
99 array<string, 4> colours = {"blue", "black", "red", "green"};
1010 for (string colour : colours){
1111 cout << colour << ' ';
1212 }
1313 cout << endl;
1414 sort(colours.begin(), colours.end());
1515 for (string colour : colours){
1616 cout << colour << ' ';
1717 }
1818 return 0;
1919 }
2066
2120
2221 /*
2322 Output:
2423 blue black red green
2524 black blue green red
2625 */