网络释义专业释义英英释义
「堆积排序法（Heap Sort）是一种树状结构的排序法，因为最大堆积的根节点就是最大的元素，换句话说，当我们将根节点移去后，只需将剩下节点重建成堆积，此...
基于142个网页-相关网页
weak-heap sort 弱堆排序法
heap sort program 堆排序程序 ; 堆分类程序
adaptive heap sort 适应堆排序法
Heap-Sort 堆排序
Achieve Heap Sort 实现堆排序
heap sort threshold 堆排序阀值
-
堆排序 - 引用次数：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
应用推荐