摘要
介绍了一种快速的排序方法——堆排序。以一个简单的实例结合完全二叉树说明了该算法的原理,给出了利用C语言实现该算法的代码,从时间复杂度和辅助存储空间的角度分析了与其他排序算法相比较的优劣。实验表明,在对大量数据进行排序时,堆排序算法效率较高。
A quick sort method called heap sort is introduced. The principle of this method is discussed by using a simple example together with completecinary tree. The codes for the method realized by C are provided. The ad- vantages an disadvantages are analysed in comparison with other sort methods in term of time frame and assist memory space. Experiment indicates when sorting mass data, the heap sort has better efficiency.
出处
《电讯技术》
北大核心
2012年第2期225-229,共5页
Telecommunication Engineering
