原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
s, and so on. Theorem 11.6 Given an open-address hash table with load factor α = n/m < 1,
the expected number of probes in an unsuccessful search is at most 1/(1 − α)
, assuming independent uniform permutation hashing and no deletions. Proof In an unsuccess
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea