## 线性对数阶排序算法的时间复杂度实验对比研究

Title    Experimental comparative study of time complexity of                     源自六;维,论/文.网*加7位QQ324`9114 www.lwfree.cn
several lineal logarithmic order sorting algorithm
Abstract
Traditional methods of obtaining the time complexity is seeking its expected average , although this method of analysis has more theoretical significance , but often only get the order of the time complexity , not easy to compare some of the same order meticulous function , thus the significance of the actual project is very limited. As we all know , the algorithm time complexity has the relation with the scale of the problem and the relevant instances . Compared with the theoretical analysis,the experimental method is to calculate the absolute comparison algorithm running time , although this method has significant value for practical engineering problems , but unfortunately not on the theoretical analysis , because the algorithm specific instantiation when the program is running , the calculation time even kind enough programming skills related hardware and software platforms . The innovation of this project is to creatively advantage of combining the two methods , the use of mathematical methods of theoretical analysis , draw or estimate accurately represents the order of complexity of the algorithm (try to give a more accurate order function ) , and then by numerical simulation method by calculating a large number of instances , the order function fitting and methods of comparative analysis , nuanced comparative study of different time complexity of the algorithm , using this method , we studied several linear order of sorting algorithms , namely classic quick sort , improved quick sort , heap sort and merge sort ( recursive and non-recursive included ) order coefficient complexity of the algorithm , as its complexity is relatively accurate representation , from the theoretical and practical significance to solve the problem" what is fast and what is slow between these sorting algorrithm of the order of O(nlogn)" , providing a strong basis for the theory of teaching , but also provide some reference for practical engineering calculations. 线性对数阶排序算法的时间复杂度实验对比研究:http://www.lwfree.cn/jisuanjilunwen/20171206/17487.html
------分隔线----------------------------