原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
unction is chosen at random from a suitable family of hash functions. The division method
The division method for creating hash functions maps a key k into one of m slots by taking the remainder of k divided by m.
That is, the hash function is h(k) = k mod m. For example, if the hash table has size m =
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea