专业释义英英释义
-
堆排序 - 引用次数：5
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.
文章提出基于堆排序的PQ+CBWFQ网络路由器排队调度算法进行具体实现,并给出低成本的硬件实现方案,对未来的高性能路由器设计具有重要的参考价值。
参考来源 - 基于堆排序的PQ+CBWFQ路由器排队调度算法 in C堆分类锥形排序法 -
堆排序
·2,447,543篇论文数据，部分数据来源于NoteExpress
Heapsort
- abstract: Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family. Although somewhat slower in practice on most machines than a well-implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtime.
以上来源于: WordNet
双语例句权威例句
-
Heap Sort has the additional benefit of being quite consistent in its speed, so it is useful in programs where timing is crucial (i. e. networks).
堆排序的另外一个好处是它的速度非常稳定，这让它得以在那些需要严格计时的程序中派上用场(例如网络)。
-
Use appropriate indexes to minimize the use of the sort heap.
使用合适的索引使排序堆的使用降到最低。
-
It works the same way for sort heap, as we'll see in the sort heap section below.
正如将在下面的排序堆一节中所看到的，它的工作方式与排序堆的相同。
应用推荐