原书出处
Introduction to Algorithms, Fourth Edition
6 第6章 堆排序
in using the term “heap” to refer to the data structure, not the storage class. 6.1 Heaps
The (binary) heap data structure is an array object that we can view as a nearly complete binary tree
(see Section B.5.3), as shown in Figure 6.1. Each node of the tree corresponds to an elem
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea