heapsort

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.

heapsort用法及例句

例句参考

Heapsort

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)