摘要
本文阐述了应用堆排序的思想方法对基本有序的大批量的数据进行排序的另一种方法——分段堆排序。对分段堆排序法进行了时间复杂度和空间复杂度的分析及与其它排序方法的对比。
In this paper ,the author expounds a new method - segmentation heap sort, which is used to sort basically ordered and mass data with the method of thinking of heap sort. The author analyses the time and space complexity of segmentation heap sort and compares this method with other methods of sorting.
出处
《微电子技术》
2002年第6期54-54,58,共2页
Microelectronic Technology
关键词
堆
堆排序
时间复杂度
heap
heap sort
time complexity
