Analysis based on experimental statistics about time complexity of commonly usedsorting algorithm
Zheng Ming-xi · jOURNAL OF southwest University for Nationalities · 2015
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.