heapsort

基本解释

I mainly responsible for sequencing and HEAPSORT Hill.
我主要負責的是希爾排序和堆排序。
The experiment certifies that the time property of the new algorithm is superior to that of the best in-place heapsort.
實騐表明，新算法的時間性能優於目前最好的原地排序一堆排序。
The index sort and heapsort was applied to distribute the migration work of each node and realize dynamic load balance.
提出運用索引排序方法以實現節點計算任務靜態分配負載平衡,運用堆排序算法以實現節點計算任務動態分配負載平衡。
And then create a stack (heap) type, the data in order to stack the form of storage, can be carried out and various operation HEAPSORT.
詳細說明：簡易學生信息琯理系統程序實現思路：先創建一個學生元素類，用於存放學生的各種數據。然後創建一個堆(heap)類，把數據以堆的形式存儲，可便進行堆排序及各種操作。
Heapsort traverse
堆排序