原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
ion that, unlike chaining, does not make use of storage outside of the hash table itself.
In open addressing, all elements occupy the hash table itself.
That is, each table entry contains either an element of the dynamic set or NIL. No lists
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea