11. INSERTION SORT IN ARRAY #include<iostream.h> #include<conio.

h> void insert_sort(int A[], int n) { int i, j, current, pos; for(i=1;i<n; i++) { current=A[i]; pos=0; while((pos<i)&&(A[pos]<=current) pos++; } if (pos!=i) { for(j=i-1; j>=pos; j++) {A[j+1]=A[j]; } A[pos]=current; } } void main() { clrscr(); int i,n; int a[30]; cout<<"enter the number of elements"; cin>>n; cout<<"\nEnter the elements\n"; for(i=0;i<n;i++) { cin>>a[i]; } insert_sort(a,n); cout<<"The sorted array is as below\n"; for(i=0;i<n;i++) cout<<a[i]; getch(); }