← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

11 第11章 散列表

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.687Z

tive method for resolving collisions, called open addressing. Independent uniform hashing

An “ideal” hashing function h would have, for each possible input k in the domain U, an output h(k) that is an element randomly and independently chosen uniformly from the range {0, 1,

…, m − 1}. Once a value h(k) is randomly chosen, each subsequent call to h with the same

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea