原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
e path from this node toward the root to find a proper place for the newly increased key.
As MAX-HEAP-INCREASE-KEY traverses this path, it repeatedly compares an element’s key to that of its parent, exchanging pointers and continuing if the element’s key is larger, and terminating if the element’s key is smaller, since the max-heap property now holds.
(See Exercise 6.5-7 for a precise loop invariant.) Like MAX-HEAPIFY when used in a priori
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea