https://github.com/lionliuchen/algorithm/tree/master/sort/Insertion-Sort
我摘维基百科的一部分
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
//数组的长度
#define N 1000000
//需要排序的个数
#define num 100000
using namespace std;
int a[N];
//插入排序
void insertion_sort(int arr[],int len)
{
int i,j,temp;
for (i = 1; i < len; i++) {
temp=arr[i];
for(j=i-1;j>=0&&arr[j]>temp;j--)
arr[j+1]=arr[j];
arr[j+1]=temp;
}
}
//判断是否排序
bool isSorted(int arr[],int n){
bool flag = true;
for(int i=0;i<n-1;++i){
if(arr[i+1]<arr[i]){
flag = false;
break;
}
}
return flag;
}
int main()
{
srand((unsigned)time(NULL));
for (int i = 0; i < num; i++)
{
a[i]=rand()%N;
}
clock_t start_time=clock();
{
insertion_sort(a,num);
}
clock_t end_time=clock();
printf("Running time is: %lfms\n",static_cast<double>(end_time-start_time)/CLOCKS_PER_SEC*1000);
printf("%s\n",isSorted(a,num) == true ? "true":"false");
return 0;
}
10000个数据
100000个数据
参考网址
https://blog.youkuaiyun.com/qq_24028753/article/details/75108075