To sort the given numbers using insertion sort

Program:

#include<stdio.h>
#include<conio.h>
void main()
{
    int i, j, n, a[10], t;
    clrscr();
    printf("Enter the limit : ");
    scanf("%d", &n);
    printf("\nEnter the elements :\n\n");
    for(i = 0; i < n; i++)
    scanf("%d", &a[i]);
    for(j = 1; j < n; j++)
    {
        t = a[j];
        for(i = j - 1; i >= 0 && t < a[i]; i--)
        a[i + 1] = a[i];
        a[i + 1] = t;
    }
    printf("\nThe sorted elements are :\n\n");
    for(i = 0; i < n; i++)
    printf("%d\t", a[i]);
    getch();
}

Output:

Enter the limit : 5
Enter the elements :
20 40 30 50 10
The sorted elements are :
10 20 30 40 50