insertionsort.c

void InsertionSort(A)

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