← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

第五部分 高级数据结构

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.705Z

son-based data structures. If the keys are unique integers drawn from the set {0, 1, 2, …

, u − 1}, where u is an exact power of 2, then a recursive data structure known as a van Emde Boas tree [440, 441] supports each of the operations SEARCH, INSERT, DELETE, MINIMUM, MAXIMUM, SUCCESSOR, and PREDECESSOR in O(lg lg u) time.

Fusion trees [157] were the first data structure to allow faster dictionary operations wh

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/part005.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea