Insertion Sort in C

#include<stdio.h>
int main()
{
    int arr[]={8,5,7,4,3,0};
    int n = sizeof(arr)/sizeof(int);
    int key=0,i=0,j=0;
    for(i=1;i<n;i++){
        key=arr[i];
        j=i-1;
        while(j>=0 && arr[j]>key){
            arr[j+1]=arr[j];
            j--;
        }
        arr[j+1]=key;
    }
     for(i=0;i<n;i++){
        printf("%d\t",arr[i]);
    }
    printf("\n");
    return 0;
}