KNOW: Hash Table

b_end_an

于 2013-08-06 05:30:06 发布

阅读量573

点赞数

CC 4.0 BY-SA版权

分类专栏： !!!Interview Topics

本文链接：https://blog.youkuaiyun.com/b_end_an/article/details/9783081

!!!Interview Topics 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了哈希表的基本概念，包括哈希函数的作用、负载因子的定义以及再哈希的过程。同时，针对哈希冲突提出了两种解决方案：分离链接法和开放寻址法，并概述了线性探测和二次探测的具体实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

CH 5 in DS and AA

Definition

In computing, a hash table (also hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found. (from wiki)

A hash function is any algorithm that maps data of variable length to data of a fixed length. The values returned by a hash function are called hash values, hash codes, hash sums, check sums or simply hashes. (from wiki)

load factor, λ, is the ratio of the number of elements in the hash table to the table size.

Rehashing: When the has table is too full, we can build another table that is about twice as big (with an associated new hash function) and scan down the entire original hash table, computing the new hash value for each (nondeleted) element and inserting it in the new table.