原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
o be Θ(1 + α). Theorem 11.2 In a hash table in which collisions are resolved by chaining,
a successful search takes Θ(1 + α) time on average, under the assumption of independent uniform hashing.
Proof We assume that the element being searched for is equally likely to be any of the n
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea