散列(哈希):拉链法、开放地址法(一次勘测、二次勘测)、双哈希、重哈希;
C语言实现模板:拉链法、开放地址法
本文为本人学习过程中整理的学习笔记,想顺带学英语所以用英文呈现。发现错误还烦请指正。欢迎交流。
未经同意,请勿转载。
文章目录
Hashing
General Idea & Basic Concepts
- Identifier Density: n / T n/T n/T
- Loading Density: λ \lambda λ = current loading element / total slot
- Collision: Two nonidentical identifiers are hashed into the same bucket.
- Overflow: A new identifier is hashed into a full bucket.
Without overflow,
T s e a r c h = T i n s e r t = T d e l e t e = O ( 1 ) T_{search} = T_{insert} = T_{delete} = O(1) Tsearch=Tinsert=Td