插入排序

1、插入排序在一定意义上来说就就是冒泡排序啊
2、

void insert_sort(int array[], int length)
{
    int inner = 0;
    int outer = 0;
    int median = 0;
    if(NULL == array || 0 == length)
        return;

    for(outer = 1; outer <length; outer ++){
        for(inner = outer; inner >= 1; inner --){
            if(array[inner] < array[inner -1]){
                median = array[inner];
                array[inner] = array[inner -1];
                array[inner -1] = median;
            }else{
                break;
            }
        }
    }
}

源码来源：http://blog.csdn.net/feixiaoxing/article/details/6844826