【摘要】 本文给出一个新的整序算法。该算法采用堆结构,重新堆化用递归实现。它不仅具有渐近最优性能,而且将文献[1]和[5]中的算法统一起来,作为它运行时的特例。更多还原

【Abstract】 A new sorting algorithm is given in this paper. It is designed by using heap structure, and we use recursion to implement the process of rearranging the heap. It not only has asymptotic optimal performance, but also unifies the algorithms in Referenees[1]and[5] as the special cases when it runs,更多还原