原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
in the nodes satisfy a heap property, the specifics of which depend on the kind of heap.
In a max-heap, the max-heap property is that for every node i other than the root, A[PARENT(i)] ≥ A[i]
, that is, the value of a node is at most the value of its parent. Thus, the largest eleme
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea