原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
set the key of this new element to its correct value and maintain the max-heap property.
The running time of MAX-HEAP-INSERT on an n-element heap is O(lg n) plus the overhead for mapping priority queue objects to indices.
In summary, a heap can support any priority-queue operation on a set of size n in O(lg n)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea