insertion sorting

//* wap a program of insertion sorting *//

#include
#include
void main()
{
int Array[10]={89,43,63,43,94,5,34,63,12,3};
int a,b,t;
clrscr();
printf("\n Ur Unsorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);
//-------------------------------------

for(a=0;a<9;a++)
{
for(b=1+a; b>=1;b--)
{
if(Array[b] < Array[b-1])
{
t=Array[b];
Array[b]=Array[b-1];
Array[b-1]=t;
}
}
}

//-------------------------------------
printf("\n\n\n\n Ur Sorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

getch();
}