资 源 简 介
用基于变治法的堆排序算法对任意一组给定的数据进行排序
设计与实现堆排序算法；
2）待排序的数据可以手工输入(通常规模比较小，10个数据左右），用以检测程序的正确性；也可以计算机随机生成（通常规模比较大，1500－3000个数据左右），用以检验(用计数法)堆排序算法的时间效率。-Variable-based treatment of the heap sorting algorithm to a set of arbitrary data set to sort the design and implementation of heap sort algorithm 2) to be sort of data can be entered manually (usually relatively small size of about 10 Data), to detect the correctness of the procedure also can be randomly generated computer (usually relatively large-scale data ,1500-3000 or so), to test (with counting) time sorting algorithm reactor efficiency.
