heapsort英 [hi:p'sɔ:t] 美 [hip'sɔt]
释义堆排序;
英英释义
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
权威例句
HeapsortHeapsortHeap-SortAdaptive HeapsortThe Analysis of HeapsortThe analysis of heapsortHeaps and heapsort on secondary storage ☆Average-case results on heapsortOn the Performance of WEAK-HEAPSORTOn the Performance of WEAK-HEAPSORTA variant of heapsort with almost optimal number of comparisonsBOTTOM-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)