DS (RM) Program - Insertion Sort
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 | #include<iostream.h> #include<conio.h> int main() { clrscr(); int a[5],i,j,k,temp,n; cout<<"How many elements you want to enter : "; cin>>n; cout<<"Enter element : \n"; for(i=0; i<n; i++) { cin>>a[i]; } for(i=1; i<n; i++) { for(j=i; j>=1; j--) { if(a[j] < a[j-1]) { temp = a[j]; a[j] = a[j-1]; a[j-1] = temp; } else break; } } cout<<endl<<"sorted array : \n"<<endl; for(k=0; k<n; k++) { cout<<"\t"<<a[k]; } getch(); } |
Output:
How many elements you want to enter : 4 Enter element :
23
90
2
9
sorted array :
2 9 23 90
