弗洛伊德算法，堆排序的时间，主要由建立初始堆和反复重建堆这两部分的时间开销构成，它们均是通过调用Heapify实现的。 -Floyd algorithm, HEAPSORT time, mainly by the establishment of the initial stack and heap repeatedly reconstruction spending time in these two parts of composition, they are by calling H

heapsort en c para diseñ o de algoritmos

堆排序的算法， 堆的建立，筛选，数据结构排序算法 -Heap sort algorithm, the establishment of the heap, filtering, data structure sorting algorithm

在Visual C++环境下实现算法与数据结构中堆排序，采用面向对象的思想编程实现-Heap sort algorithm and data structure in Visual C++ environment, using the idea of ​ ​ object-oriented programming to achieve