insert sort算法实现

void
insert_sort(int *arr, int n)
{
    int index_i, index_j;
    int tmp;

    if(arr == NULL || 0 == n)
        return;

    for(index_i = 1; index_i < n; index_i++)
    {
        if(arr[index_i] < arr[index_i-1])
        {
            index_j = index_i;
            tmp = arr[index_i];

            while(index_j > 0 && arr[index_j-1] > tmp)
            {
                arr[index_j] = arr[index_j-1];
                index_j--;
            }

            arr[index_j] = tmp;
        }
    }

    return;
}

int
main(int argc, char *argv[])
{
    int line[200] = {1,3,2,10,30,11,13,8,5,3,0};
    int index;

    printf("before sort : line -> \t");
    for(index = 0; index < 11; index++)
        printf("%d ", line[index]);

    printf("\n");
    insert_sort(line, 11);
    printf("after sort : line -> \t");
    for(index = 0; index < 11; index++)
        printf("%d ", line[index]);

    printf("\n");
    return 0;
}