堆排序

堆排序是一种比较快的排序方法，贪心算法中常常要找到最小（大）值。

Heapsort is a kind of quick sort algorithm , the minimum ( or maximum ) can be found by the greedy algorithm .

最优堆排序算法

An optimal HEAPSORT algorithm

QoS保障机制中的FPGA堆排序实现

FPGA Realization of Heap Sort in QoS Guarantee Mechanism

快速傅里叶变换（FFT）和堆排序算法都是常见的算法，它们在信号传输和科学计算等方面都有着广泛的应用。

Fast Fourier Transform ( FFT ) and Heap Sort algorithm FFT algorithm are very common , they are widely applied in signal transmission range and scientific calculation .

对堆排序的改进算法PS-EM算法对N。

The SEM algorithm is improved by PS-EM algorithm .

本文引入了堆排序机制，并应用到问题的求解过程中，通过两个算例的模拟，结果表明，该算法能求出比较合理的Pareto最优解集，表明了其有效性。

This paper presents cone-sorting concept and applies it to practical problem 's processing , the simulation results indicate the improved algorithms can figure out the Pareto-optimal solution set , and show the algorithms are practical .

关于一种准堆排序机实现方法的研究一是科学取向。

An Approach to a Like-stack Sorting Machine " Science " approach .

基于堆排序的PQ+CBWFQ路由器排队调度算法

Queue Scheduling Algorithm of the PQ + CBWFQ in Router Based on Heap Sort

简单选择排序；冒泡排序；快速排序；堆排序。

Directly into the sort simple selection sort bubble sort quick sort heap sort .

堆排序应用及分析

The application and analysis of heap sort

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

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

在最小走时节点查寻中，结合使用快速排序算法与插入排序算法，替代以往方法中多采用的堆排序算法；

To speed up computation , we use Quick Sort algorithm and Insertion Sort algorithm instead of usually used Heap Sort algorithm .

堆排序是一个高效的排序算法，其特点是辅助空间小，可以就地排序。

Heap sort is an effective sorting algorithm and can operate " in place " , as it re-quires smallest additional storage .

文章提出基于堆排序的PQ+CBWFQ网络路由器排队调度算法进行具体实现，并给出低成本的硬件实现方案，对未来的高性能路由器设计具有重要的参考价值。

This paper offers a queue scheduling algorithm of the PQ + CBWFQ in router based on heap sort , algorithm realization and hardware plan of low-cost . It is of important significance to design high-performance router in future .

如果无法将排序的数据整个放入排序堆中（排序堆是每次执行排序时分配的一块内存），它就会溢出到该数据库所有的临时表中。

If the sorted data cannot fit entirely into the sort heap , which is a block of memory that is allocated each time a sort is performed , it overflows into a temporary table owned by the database .

阈值后排序（Postthresholdsort）是在超出排序堆阈值之后，请求堆的排序数目。

Post threshold sorts is the number of sorts that have requested heaps after the sort heap threshold has been exceeded .

在网络结构设计中，又创新性的提出了堆网络概念，堆网络中以堆排序的方式产生最优的超结点来管理普通结点，超结点又组成更大的B-树网络。

For the network architecture , the dissertation provides a conception of " heap network ", in which the super node is selected by Heap sort and administer upon nodes . Then , these super nodes form themselves into a larger B-tree network .