/* Insertion Sort */
/* Made By Gaurang */
/* gaurang85.tripod.com */

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

int array[20],num;
void insert(int);

int main()
{
	int i,j,pos;
	clrscr();
	printf("\n Enter No OF Numbers to sort : ");
	scanf("%d",&num);
//get the numbers from user and put it in an array
	for(i=0;i<num;i++)
	{
		printf("\nEnter Number %d : ",i+1);
		scanf("%d",&array[i]);
	}

for(j=1;j<num;j++)
{
pos=0;
for(i=1;i<num;i++)
{
	if(array[0]>array[i])
	{
		pos=i;
	}
}
insert(pos);
}
//print sorted array
printf("\n\n");
	for(i=0;i<num;i++)
	{
		printf(" %d ",array[i]);
	}
	getch();
	return 0;
}


void insert(int pos)
{
int temp,k;
//WE HAVE TO INSERT array[0] before array[pos]
	temp=array[0];
	for(k=0;k<pos;k++)
	{
		array[k]=array[k+1];
	}
	array[pos]=temp;
}