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.