visit-www.Codes2u.

com
#include<stdio.h> #include<conio.h> int a[100],n; int binarysearch(int a[],int l,int h,int k); void insertion(int a[],int n); void main() { int i ; clrscr(); printf("\n enter the no of items to be sorted"); scanf("%d",&n); printf("\n enter the array of numbers to be sorted"); for(i=1;i<=n;i++) { scanf("%d",&a[i]); } insertion(a,n); printf("\n the sorted array of numbers is"); for(i=1;i<=n;i++) { printf("%d ",a[i]); } getch(); } void insertion(int a[],int n) { int key,i,j,q; for(j=2;j<=n;j++) { key=a[j]; q=binarysearch(a,1,j-1,key); for(i=j-1;i>=q;i--) { a[i+1]=a[i]; } a[q]=key; } } int binarysearch(int a[],int l,int h,int k) { int mid; if(l==h) { if(a[l]<k) return l+1; else return l; } mid=(l+h)/2; if(a[mid]==k) { return(mid);

} if(a[mid]<k) { binarysearch(a,mid+1,h,k); } else binarysearch(a,l,mid,k); }