9种排序算法性能之比较之----插入排序

9种排序算法之性能比较

        本系列对9种排序算法（插入，选择，冒泡，快速，归并，堆，计数，基数，希尔）做一下性能的比较，关于算法本身本系列不再赘述，直接给出代码实现、测试数据及分析报告。

（一）插入排序

/*!

 * 插入排序

 */

double InsertionSort(int *data, int size)

{

    double res = 0;

    int tmp;

    int j;

    //EClock<> Ek;

    for(int i=1; i<size; i++) {

        tmp = data[i];

        j = i-1;

        while(j>=0 && data[j] > tmp) {

            data[j+1] = data[j];

            j--;

        }

        data[j+1] = tmp;

    }

    //res = Ek.microsecond();

    return res;

}

测试结果：

                   时间单位：us                           

100.301869933200.603739867500.6037398671002.4149594662009.96170779950056.751547461000129.80407132000488.72742230001808.8046440001921.70399550003003.90770660004299.8353370005935.06475980007674.439314900010589.899131000012203.997662000051320.6054950000305791.52561000001255023.9462000004878850.23850000032029114.4580000089666040.991000000

127918208.6

变化趋势：