原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
tion. Thorup also describes the method for deletion in a hash table using linear probing.
Fredman, Komlós, and Szemerédi [154] developed a perfect hashing scheme for static sets—“perfect” because all collisions are avoided.
An extension of their method to dynamic sets, handling insertions and deletions in amorti
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea