heapsort



释义
堆排序;
英英释义
Heapsort
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.
以上来源于:Wikipedia
权威例句
HeapsortHeapsort
Heap-Sort
Adaptive Heapsort
The Analysis of Heapsort
The analysis of heapsort
Heaps and heapsort on secondary storage ☆
Average-case results on heapsort
On the Performance of WEAK-HEAPSORT
On the Performance of WEAK-HEAPSORT
A variant of heapsort with almost optimal number of comparisons
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
1. Select call from the center menu to redial the number.
从中间菜单中选择Call重新拨号.
来自互联网
2. Wait a few minutes, and then click the Redial button.
等待几分钟后单击“重拨”按钮.
来自互联网
3. Would you like to redial, cancel, or try a different phone number?
是否想重拨 、 取消或试拨其它号码?
来自互联网
4. Click the Redial button when you are ready to try reconnecting.
当您想重新连接时,请单击“重拨”按钮.
来自互联网
5. Sorry, the subscriber arecannot be connected now. Please redial later.
对不起, 您所拨打的用户暂时无人接听, 请稍候再拨.
来自互联网
[ redial 造句 ]
heapsort




