原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
ntain the largest values in the array, in sorted order. (k) The resulting sorted array A.
The HEAPSORT procedure takes O(n lg n) time, since the call to BUILD-MAX-HEAP takes O(n) time and each of the n – 1 calls to MAX-HEAPIFY takes O(lg n) time.
Exercises 6.4-1 Using Figure 6.4 as a model, illustrate the operation of HEAPSORT on the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea