原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
ch subset is managed independently as a list. Figure 11.3 shows the idea behind chaining:
each nonempty slot points to a linked list, and all the elements that hash to the same slot go into that slot’s linked list.
Slot j contains a pointer to the head of the list of all stored elements with hash value
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea