原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
iority queue accesses this index, the index is entirely hidden from the application code.
Because heap elements change locations within the array during heap operations, an actual implementation of the priority queue, upon relocating a heap element, must also update the array indices in the corresponding handles.
Conversely, each element in the heap might contain a pointer to the corresponding applica
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea