一种新的排序算法研究

Study on a New Sort Algorithm

排序是计算机科学中最重要的研究问题之一。介绍了一种新的排序算法,全面深入地分析了挤压式排序的算法思想以及算法实现,并对该算法在时间和空间上的复杂度进行了分析,与快速排序算法、希尔排序算法进行了理论上的对比。理论分析及实验数据表明,该算法是正确的,可行的,在同类排序算法中有明显优势。

Sorting is one of the most important research problems in the area of Computer Science. In this paper, a new sorting algorithm called Squeeze sort is introduced. There are detailed analyses about the thought of this sorting algorithm and the comparison with Quick sort and Shell sort in theory in the paper. It also gives the algorithm implementation in C＋＋. Both theoretical analysis and experimental tests confirm that Squeeze sort algorithm is correct, feasible and has obvious advantages when compared with other algorithms using similar methods.