# 各个排序的效率比较

> 来源：梦飞idc云平台 | 原文：https://www.mfisp.com/25985.html | 发布：2023-12-14 | 更新：2023-12-14 | 分类：建站教程

## 各个排序的效率比较

 

测试函数的定义

 

void TestOP()  
{  
 srand(time(0));  
 const int N = 100000;  
 int* a1 = (int*)malloc(sizeof(int) * N);  
 int* a2 = (int*)malloc(sizeof(int) * N);  
 int* a3 = (int*)malloc(sizeof(int) * N);  
 int* a4 = (int*)malloc(sizeof(int) * N);  
 int* a5 = (int*)malloc(sizeof(int) * N);

 

for (int i = N - 1; i >= 0; --i)  
 {  
 a1[i] = rand();  
 a2[i] = a1[i];  
 a3[i] = a1[i];  
 a4[i] = a1[i];  
 a5[i] = a1[i];  
 }

 

int begin1 = clock();  
 InsertSort(a1, N);  
 int end1 = clock();

 

int begin2 = clock();  
 ShellSort(a2, N);  
 int end2 = clock();

 

int begin3 = clock();  
 BubbleSort(a3, N);  
 int end3 = clock();

 

int begin4 = clock();  
 HeapSort(a4, N);  
 int end4 = clock();

 

int begin5 = clock();  
 SelectSort(a5, N);  
 int end5 = clock();

 

printf("InsertSort:%d\n", end1 - begin1);  
 printf("ShellSort:%d\n", end2 - begin2);  
 printf("BubbleSort:%d\n", end3 - begin3);  
 printf("HeapSort:%d\n", end4 - begin4);  
 printf("SelectSort:%d\n", end5 - begin5);  
   
 free(a1);  
 free(a2);  
 free(a3);  
 free(a4);  
 free(a5);  
}

 

从这次时间效率来看  
堆排序>希尔排序>直接插入>选择排序>冒泡排序

---
本页由 梦飞idc云平台（https://www.mfisp.com）提供。站点导航见 https://www.mfisp.com/llms.txt