插入排序,升序

#include <stdio.h>

//插入排序,升序
/*
for j = 2 to A.length
    key = A[j]
    //insert A[j] into sorted sequence A[1..j - 1].
    i = j - 1
    while i > 0 and A[i] > key
        A[i + 1] = A[i]
        i = i - 1
    A[i + 1] = key
*/

bool insertSort(int* data, int length);

int main()
{
    int testData[] = {1, 2, 78, 63, 47, 96, 32, 14, 78, 96, 35, 14, 63, 25, -1, -3};
    int length = sizeof(testData) / sizeof(int);
    if(insertSort(testData, length))
    {
        for(int i = 0; i < length; i++)
        {
            printf("%d ", testData[i]);
        }
    }
    return 0;
}

bool insertSort(int* data, int length)
{
    if(data == NULL || length == 0)
    {
        printf("invalid data or length\r\n");
        return false;
    }
    int i = 0;
    int j = 0;
    int index = 0;
    for(i = 1; i < length; i++)
    {
        index = data[i];
        j = i - 1;
        while(j > -1 && data[j] > index)
        {
            data[j + 1] = data[j];
            j--;
        }
        data[j + 1] = index;
    }
    return true;
}