原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
ne H to be the family of multiply-shift hash functions with odd constants a: Theorem 11.5
The family of hash functions H given by equation (11.5) is 2/m-universal.
▪ That is, the probability that any two distinct keys collide is at most 2/m. In many pra
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea