Insertion Sort Method

// Program to sort data in Ascending Order Using Insertion Sort Method

#include<  stdio.h >
#include< conio.h >


void main()
{
//variable declaration
int a[10],i,j,n,temp;


clrscr();
printf("Enter Total Number of Elements :: ");
scanf("%d",&n);
printf("\n Enter Elements :: ");


//Input array element
for(i=0;i< n;i=i+1)
{
scanf("%d",&a[i]);
}


//Print Unsorted List
printf("\n Unsorted List :: \n");
for(i=0;i< n;i=i+1)
{
printf("\t%d",a[i]);
}


//Sort data in ascending order
for(i=1;i < = n;i++)
{
temp=a[i];
j=i-1;
while ((temp < a[j]) && (j >=0))
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=temp;
}


//Print Sorted List
printf("\n Sorted List :: \n");
for(i=0;i < n;i=i+1)
{
printf("\t%d",a[i]);
}
getch();
}