摘要
堆整序算法因其比较次数和所需额外空间少而被广泛地采用。本文给出了对传统堆整序算法的两个改进算法,它们都降低了原算法的复杂度因子。在n较大时,能较明显地提高算法的效率。
In this paper, two new improved heapsort algorithms are given. Compared with the old one, the constant factor of the complexity has been reduced and the efficency is increased highly when the size n is bigger.
出处
《计算机应用与软件》
CSCD
1998年第5期42-45,共4页
Computer Applications and Software
