Insertion sort

#include<stdio.h>
int main()
{
    int n,i,j;
    scanf("%d",&n);
    int a[n];
    for(j=0; j<n; j++)
    {
        scanf("%d",&a[j]);
    }

    for(j=1; j<n; j++)
    {
        int key=a[j];
        i=j-1;
        while(i>=0 && a[i]>key)
        {
            a[i+1]=a[i];
            a[i]=key;
            i=i-1;

        }


    }
    for(i=0; i<n; i++)
    {
        printf("%d ",a[i]);
    }
    printf("\n");


}