原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
or an element with a given key? Given a hash table T with m slots that stores n elements,
we define the load factor α for T as n/m, that is, the average number of elements stored in a chain.
Our analysis will be in terms of α, which can be less than, equal to, or greater than 1.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea