C Program for insertion SORT

#include<stdio.h>
#include<conio.h>
void insertsort(int[],int);
void display(int[], int);
void main()
{
int num[20];
int n,i;
clrscr();
printf("\n OUTPUT");
printf("\n **********");
printf("\nEnter the value of N: ");
scanf("%d",&n);
printf("\nEnter %d Numbers:\n",n);
for(i=0;i<n;i++)
scanf("\t%d",&num[i]);
printf("\n Given Input: ");
for(i=0;i<n;i++)
printf("%d ",num[i]);
printf("\n");
insertsort(num,n);
printf("\n\t\tInsertion Sort");
printf("\n\t\t**************\n\n");
for(i=0;i<n;i++)
printf("\t\t%d ",num[i]);
getch();
}
void insertsort(int a[],int n)
{
int i,j;
int index;
printf("\n Number of passes : %d", n-1);
printf("\n");
for(i=0;i<n;i++)
{

printf("\n PASS %d:",i);
index= a[i];
printf("\n");
printf("\n Index Element: %d", index);
printf("\n");
for(j=i;j>0&&a[j-1]>index;j--)
{
printf("\n Iteration %d:", j);
printf("\n");
printf("\n Comparison Elements: %d %d", a[j-1], index);
a[j]=a[j-1];
printf("\n After the iteration %d: %d %d", j, a[j],a[j-1]);
display(a,n);

}
Next..