heapsort

heapsort

1. Heapsort traverse

堆排序

2. The experiment certifies that the time property of the new algorithm is superior to that of the best in-place heapsort.

实验表明，新算法的时间性能优于目前最好的原地排序一堆排序。

3. I mainly responsible for sequencing and HEAPSORT Hill.

我主要负责的是希尔排序和堆排序。

4. The index sort and heapsort was applied to distribute the migration work of each node and realize dynamic load balance.

提出运用索引排序方法以实现节点计算任务静态分配负载平衡,运用堆排序算法以实现节点计算任务动态分配负载平衡。