排序之插入排序

插入排序使用的增量方法，主要思想是遍历数组中的所有元素，将当前遍历的元素插入到前面已经排好序的子数组中。

C语言实现源码如下：

#include<stdio.h>
#include"demo.h"

/*
 *  insert key into the sorted sequence.
 */
void insertKeyToSortedSeq(__INOUT int arr[], __IN int len, __IN int key)
{
    int index = len-2;
    
    /* when index <0 or arr[index] <= key 
       means find the key's index of sorted sequence  */
    while(index >= 0 && arr[index] > key)
    {
        /* not find key's index
           move current value to next position  */
        arr[index+1] = arr[index];
        index--;
    }
    
    arr[index+1] = key;
}


/*
 *  list for arr
 *  insert key into sorted sequence 
 */
void insertSort(__INOUT int arr[], __IN int len)
{
    int key = 0;
    int index = 0;
    
    for(index = 1; index < len; index++)
    {
        key = arr[index];
        
        /* sorted sequence's len is index+1 including key.  */
        insertKeyToSortedSeq(arr, index+1, key);
    }
}

int main()
{
    int arr[] = {9, 2, 3, 8, 9, 1, 22, 10, 20, 22};
    int index = 0;
    int arrLen = sizeof(arr)/sizeof(int);

    insertSort(arr, arrLen);

    for(index = 0; index < arrLen; index++)
    {
        printf("%d ", arr[index]);
    }
    printf("\n");
    
    return 0;
}