heapsort

基本解釋

I mainly responsible for sequencing and HEAPSORT Hill.
我主要負(fù)責(zé)的是希爾排序和堆排序。
The experiment certifies that the time property of the new algorithm is superior to that of the best in-place heapsort.
實(shí)騐表明，新算法的時(shí)間性能優(yōu)於目前最好的原地排序一堆排序。
The index sort and heapsort was applied to distribute the migration work of each node and realize dynamic load balance.
提出運(yùn)用索引排序方法以實(shí)現(xiàn)節(jié)點(diǎn)計(jì)算任務(wù)靜態(tài)分配負(fù)載平衡,運(yùn)用堆排序算法以實(shí)現(xiàn)節(jié)點(diǎn)計(jì)算任務(wù)動(dòng)態(tài)分配負(fù)載平衡。
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.
詳細(xì)說(shuō)明：簡(jiǎn)易學(xué)生信息琯理系統(tǒng) 程序?qū)崿F(xiàn)思路：先創(chuàng)建一個(gè)學(xué)生元素類，用於存放學(xué)生的各種數(shù)據(jù)。然後創(chuàng)建一個(gè)堆(heap)類，把數(shù)據(jù)以堆的形式存儲(chǔ)，可便進(jìn)行堆排序及各種操作。
Heapsort traverse
堆排序