---------------------------
INSERTION SORT
---------------------------
#include<stdio.h>
void insertion(int a[],int n)
{
int i,j,item;
for(i=1;i<n;i++)
{
item=a[i];
for(j=i-1;(j>=0)&&(a[j]>item);j--)
{
a[j+1]=a[j];
}
a[j+1]=item;
}
}
int main()
{
int a[60],i,n;
printf("\n enter the size of the array::");
scanf("%d",&n);
printf("\n enter the elements of the array::");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
insertion(a,n);
printf("\n display::");
for(i=0;i<n;i++)
{
printf("%4d",a[i]);
}return 0;
}