说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 二次立体堆排序
1)  second solid heap sort
二次立体堆排序
1.
A new algorithm called second solid heap sort is proposed based solid heap sort analysis with subsection optimum data processing method,the algorithm ideas,algorithm description and analysis is given,efficiency of the new algorithm is increasing better than solid heap sort algorithm along with more and more data sorted.
通过对立体堆排序算法的分析,从分段优化数据处理技术角度,提出了二次立体堆排序算法,给出了算法思想、算法描述和算法分析,论证了二次立体堆排序算法,随着排序数量增加,排序速度快于立体堆排序算法越显著。
2)  solid heap sort
立体堆排序
1.
A new algorithm called second solid heap sort is proposed based solid heap sort analysis with subsection optimum data processing method,the algorithm ideas,algorithm description and analysis is given,efficiency of the new algorithm is increasing better than solid heap sort algorithm along with more and more data sorted.
通过对立体堆排序算法的分析,从分段优化数据处理技术角度,提出了二次立体堆排序算法,给出了算法思想、算法描述和算法分析,论证了二次立体堆排序算法,随着排序数量增加,排序速度快于立体堆排序算法越显著。
3)  twice bucket sorting method by linking
二次链接桶排序
1.
In this paper, the bucket sorting method in [1] is studied further, and ahighly-efficient bucket sorting method-twice bucket sorting method by linking,which is suitable to non-uniformly distributed data,is presented.
本文进一步研究了桶排序法[1],提出了适用于非均匀分布数据的高效率的二次链接桶排序法。
4)  heapsort
堆排序
1.
Improved heapsort algorithm and its complexity analysis;
改进的堆排序算法及其复杂度分析
2.
Treesort is the variant of heapsort.
树排序算法是堆排序算法的变体,本文给出了逻辑堆的结构并将其应用于树排序算法中使得树排序算法的最坏复杂度由原来的4nlogn+O(n)降低到2nlogn+O(nloglogn)+O(n),接近于最优堆排序算法(复杂度为nlogn+nloglogn+O(n),并且对几乎已有序的输入,算法的复杂度为O(nloglogn),这在n<218的实际应用中基本保持了原树排序算法的优势。
3.
Heapsort is a kind of quick sort algorithm, the minimum(or maximum) can be found by the greedy algorithm.
堆排序是一种比较快的排序方法,贪心算法中常常要找到最小(大)值。
5)  heap sort
堆排序
1.
In view of the requirement of Quality of Service(QoS) realization mechanism and strict dynamic priority arrangement,this paper introduces a kind of heap sort algorithm for FPGA realization easily in the exchange system design.
针对服务质量(QoS)的实现机制和严格动态优先级排序要求,在交换系统设计中引入一种易于FPGA实现的堆排序算法。
6)  stack sortable
堆栈排序
补充资料:输出反馈(见线性二次型次优控制)


输出反馈(见线性二次型次优控制)
output feedback

  3h日c卜口fon以以{输出反馈型次优控制。(output王eedbaek)见线性二次
  
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条