Program to implement insertion sort in C.

Here is the code..

// TO PERFORM INSERTION SORT
#include<stdio.h>

#define n 5
int a[n];
void insertion();
void main()
{int i;
i=n;

printf("Enter %d elements of array\n",i);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
insertion();

}
void insertion()
{
int j,k,t;
for(j=1;j<n;j++)
{
t=a[j];
k=j-1;
while(k>=0 && a[k]>t)
{
a[k+1]=a[k];
k--;
}
a[k+1]=t;
}
printf("Soted array is\n");
for(k=0;k<n;k++)
printf("%d\t",a[k]);
}

For turbo C users.

// TO PERFORM INSERTION SORT
#include<stdio.h>
#include<conio.h>
#define n 5
int a[n];
void insertion();
void main()
{int i;
i=n;
clrscr();
printf("Enter %d elements of array\n",i);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
insertion();
getch();
}
void insertion()
{
int j,k,t;
for(j=1;j<n;j++)
{
t=a[j];
k=j-1;
while(k>=0 && a[k]>t)
{
a[k+1]=a[k];
k--;
}
a[k+1]=t;
}
printf("Soted array is\n");
for(k=0;k<n;k++)
printf("%d\t",a[k]);
}