原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
ty. Its inputs are an array A with the heap-size attribute and an index i into the array.
When it is called, MAX-HEAPIFY assumes that the binary trees rooted at LEFT(i) and RIGHT(i) are max-heaps
, but that A[i] might be smaller than its children, thus violating the max-heap property.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea