原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
ed the bound to O(lg lg n) time by using randomized hashing, requiring only linear space.
An important special case of priority queues occurs when the sequence of EXTRACT-MIN operations is monotone, that is, the values returned by successive EXTRACT-MIN operations are monotonically increasing over time.
This case arises in several important applications, such as Dijkstra’s single-source shor
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea