INSERTIONSORT ఇంసెరషన్ సొర్త్

// Insertion Sort

#include
#include
void insertsort(int x[], int n)
{
int i,k,y;
for(k=1;k {
y=x[k];
for(i=k-1;i>=0 && y< x[i] ;i--)
{
x[i+1]=x[i];
}
x[i+1]=y;
}
}

void main()
{
int a[10],i,n;
printf("\n Enter no of elements ");
scanf("%d",&n);
printf("\n Enter Elements ");
for(i=0;i< n;i++)
{
scanf("%d",&a[i]);
}
insertsort(a,n);
printf("\n Elements After Sort ");
for(i=0;i< n;i++)
{
printf("\t %d",a[i]);
}
}