原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
1) = h(k2) is at most |H|/m. In other words, with a hash function randomly chosen from H,
the chance of a collision between distinct keys k1 and k2 is no more than the chance 1/m
of a collision if h(k1) and h(k2) were randomly and independently chosen from the set {0,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea