| 7 | // it is slow sorting algorithm |
| 8 | using namespace std; |
| 9 | int main() |
| 10 | { |
| 11 | vector<int>v; |
| 12 | int n; |
| 13 | cout<<"Enter size of array/vector\n"; |
| 14 | cin>>n; |
| 15 | for(int i=0;i<n;i++) |
| 16 | { |
| 17 | int temp; |
| 18 | cin>>temp; |
| 19 | v.push_back(temp); |
| 20 | } |
| 21 | // Selection sort |
| 22 | for(int i=0;i<n;i++) |
| 23 | { |
| 24 | int sml=i; |
| 25 | for(int j=i+1;j<n;j++) |
| 26 | { |
| 27 | if(v[j]<v[sml]) |
| 28 | { |
| 29 | sml=j; |
| 30 | } |
| 31 | } |
| 32 | int temp=v[i]; |
| 33 | v[i]=v[sml]; |
| 34 | v[sml]=temp; |
| 35 | } |
| 36 | } |