原书出处
Introduction to Algorithms, Fourth Edition
第五部分 高级数据结构
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 when the universe is restricted to integers, implementing these operations in O(lg n/lg lg n) time.
Several subsequent data structures, including exponential search trees [17], have also gi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/part005.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea