삽입정렬(insertion sort)

#include <stdio.h>

int main()
{
    int a[100], i, j, N, t;

    printf("N? ");
    scanf("%d", &N);

    for (i = 0; i < N; i++)
    {
        scanf("%d", &a[i]);
    }

    for (i = 1; i < N; i++)
    {
        t = a[i];
        j = i;
        while (a[j - 1] > t && j - 1 >= 0)
        {
            a[j] = a[j - 1];
            j--;
        }
        a[j] = t;
    }

    for (j = 0; j < N; j++)
    {
        printf("%d ", a[j]);
    }
    return 0;
}