对插入排序算法的测试

来源：互联网发布：联通3g网络编辑：程序博客网时间：2024/05/21 14:53

#include <algorithm>#include <cmath>#include <time.h>#include <Windows.h>#include <iostream>using namespace std;typedef long long int _INT64;const unsigned len = 10000;_INT64 x[len] = {0};void getRandArrayNoRepeat(){for (unsigned i=0; i<len; ++i)x[i] = i;random_shuffle(x, x+len);}void insertSort1(){for (unsigned i=1; i<len; ++i)for (unsigned j=i; j>0 && x[j-1]>x[j]; --j){_INT64 t = x[j];x[j] = x[j-1];x[j-1] = t;}}void insertSort2(){for (unsigned i=1; i<len; ++i){_INT64 t = x[i];unsigned j;for (j=i; j>0 && x[j-1]>t; --j)x[j] = x[j-1];x[j] = t;}}int main(){//test1getRandArrayNoRepeat();DWORD stime = GetTickCount();insertSort1();DWORD test1 = GetTickCount();cout << "insertSort1's running time = " << test1 - stime << " ms." <<'/n';//test2getRandArrayNoRepeat();stime = GetTickCount();insertSort2();DWORD test2 = GetTickCount();cout << "insertSort2's running time = " << test2 - stime << " ms." <<'/n'return 0;}

insertSort1's running time = 266 ms.

insertSort2's running time = 156 ms.

请按任意键继续. . .

insertSort2()要比insertSort1()快15%

但是当数组大小变成100万个时，排序时间几乎需要1个小时。