时空权衡——哈希法(Time/Space Tradeoff - Hashing)

最新推荐文章于 2024-05-28 22:08:12 发布

UoM_XiaoShuaiShuai

最新推荐文章于 2024-05-28 22:08:12 发布

阅读量1.3k

点赞数

分类专栏：算法文章标签： dictionary 时间空间权衡哈希

本文链接：https://blog.csdn.net/UoM_XiaoShuaiShuai/article/details/72957149

版权

本文介绍了哈希法作为实现字典抽象数据类型的基本方法，包括哈希函数、碰撞处理（如分离链接、线性探测和双哈希）以及Rabin-Karp字符串搜索算法。哈希法适用于处理大量键的信息检索应用。

摘要由CSDN通过智能技术生成

时空权衡——哈希法(Time/Space Tradeoff - Hashing)

哈希法简介(Introduction)
Hashing is a standard way of implementing the abstract data type “dictionary”, which is a set with the operations of searching, insertion, deletion, initialisation and rehashing. The elements of this set can be anything, such as numbers, characters, character strings, etc.

The element above is called the key. Hashing is based on this idea of distributing keys among a one-dimensional array H[0..m-1] called a hash table. The method for the distribution is called hash function. The function assigns an integer between 1 to m, called hash address, to a key. e.g. h: key -> {1..m}

哈希函数(Hash Function)
If keys are integers and the size of a hash table is m, we can denote h(n) = n mod m. Actually, the has