插入排序

//插入排序
#include <stdio.h>
//先前自己写的
void insertionSort01(int *array, int length)
{
    int i = 0, j = 1, k = 0;
    int temp;
    
    while(i < length)
    {
        k = i;
        j = i + 1;
        while(k >= 0)
        {
            if(array[k] > array[j])
            {
                temp = array[k];
                array[k] = array[j];
                array[j] = temp;

                j = k;
                k--;
            }else{
                break;
            }
        }
        i++;
    }
}

//标准示例
void insertionSort02(int *array, int number_of_elements)
{
    int iter, jter;
    for(iter = 1; iter < number_of_elements; iter++)
    {
        int current_element = array[iter];
        jter = iter - 1;
        while(jter >= 0 && array[jter] > current_element)
        {
            array[jter+1] = array[jter];
            jter--;
        }
        array[jter+1] = current_element;
    }

}
void printArray(int *array, int length)
{
    int i;
    for(i = 0; i < length; i++)
    {
        printf("%d ", array[i]);
    }
    printf("
");
}

int main(void)
{
    int a[] = {3, 4, 6, 8, 1, 0, 3, -1};
    int length = 8;
    insertionSort02(a, length);
    printArray(a, length);    
    return 0;
}