本文探讨了两种哈希表实现——密集哈希表和稀疏哈希表。密集哈希表遵循传统的哈希表设计，而稀疏哈希表仅存储非空元素，通过位图来跟踪占用状态，从而节省空间。插入和查找操作在稀疏哈希表中虽较慢，但仍是常数时间复杂度。稀疏哈希表的效率与预设参数M有关，M越大，操作越慢，但空间效率更高。
密集哈希表是您普通教科书的哈希表实现.
稀疏哈希表仅存储实际设置的元素,并分割数组.引用从 comments
执行稀疏表：
// The idea is that a table with (logically) t buckets is divided
// into t/M *groups* of M buckets each. (M is a constant set in
// GROUP_SIZE for efficiency.) Each group is stored sparsely.
// Thus, inserting into the table causes some array to grow, which is
// slow but still constant time. Lookup involves doing a
// logical-position-to-sparse-position lookup, which is also slow but
// constant time. The larger M is, the slower these operations are
// but the less overhead (slightly).
要知道数组的哪些元素被设置,一个稀疏表包括一个位图：
// To store the sparse array, we store a bitmap B, where B[i] = 1 iff
// bucket i is non-empty. Then to look up bucket i we really look up
// array[# of 1s before i in B]. This is constant time for fixed M.
因此每个元素仅产生1位的开销(限制).
扫一扫
305
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
