原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
ifically, continue to double the table size upon inserting an item into a full table, but
halve the table size when deleting an item causes the table to become less than 1/4 full, rather than 1/2 full as before.
The load factor of the table is therefore bounded below by the constant 1/4, and the load
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea