原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
e high-order w-bit word of the product and r0 is the low-order w-bit word of the product.
The desired ℓ-bit hash value consists of the ℓ most significant bits of r0.
(Since r1 is ignored, the hash function can be implemented on a computer that produces on
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea