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