原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
xample of insertion by double hashing. In order for the entire hash table to be searched,
the value h2(k) must be relatively prime to the hash-table size m.
(See Exercise 11.4-5.) A convenient way to ensure this condition is to let m be an exact
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea