常用排序算法时间开销的实验统计分析

Analysis based on experimental statistics about time complexity of commonly usedsorting algorithm

以数值数据为排序对象,对交换排序、冒泡排序、选择排序、插入排序、归并排序以及快速排序等常用的六种排序算法的时间复杂度从实验统计角度进行分析和对比.本实验统计数据分析可知具有相同定性指标的排序算法,可能实际时间效率有着很大的差异,这组实验数据可为实际应用中排序算法的选择提供参考.

Based on the numerical data for sorting objects,this paper analyses and comparestime complexity about six kinds of sortingalgorithm. The six kinds of sortingalgorithm are exchange sort,bubble sort,selection sort,insertion sort,merge sort and quick sort. The real time efficiency about sorting algorithms with the same qualitativeindicatorsis of greatdifference. This set of experimental data can provide a reference for the practical application of the selection of sort algorithm.