原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
e. The need for 5-independence is by no means obvious; see the cited proofs. Theorem 11.9
If h1 is 5-independent and α ≤ 2/3, then it takes expected constant time
to search for, insert, or delete a key in a hash table using linear probing. ▪ (Indeed, t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea