插入排序

void insertSort(int A[], int length)
{
    int i, j;
    int key;
    
    for (j = 1; j < length ; ++j)
    {
        key = A[j];
        i = j - 1;
        
        while (i >= 0 && A[i] > key)
        {
            A[i + 1] = A[i];
            i -= 1;
        }
        A[i + 1] = key;
    }
}