线性时间复杂度排序算法研究及应用

Research and Application of Sorting Algorithm in Linear Time Complexity

算法在程序设计中起着至关重要的作用,一个好的算法可以让程序变得高效。排序作为数据处理最基本的工作之一,在程序中需要大量使用。常见的几种排序算法的平均时间复杂度最优为O(nlog2n),为从根本上提高程序的运行效率,对能够在线性时间解决数据排序的算法进行了研究,并在实际问题中对桶排序算法加以了应用。

Algorithm plays a vital role in the program designing; a good algorithm can make the program more efficient. Ranking is as one of the most fundamental tasks of data processing which is used greatly in the program. The best time complexity of several common sorting algorithms isO（nlog2 n）, in order to improve the operating efficiency of the program fundamentally, this article wants to seek for a sorting algorithm which can resolve data sorting under linear time, and then we apply the algorithm in actual problems.