ECE244H1 Chapter 16: ECE244 Hashtables
DepartmentElectrical and Computer Engineering
This preview shows half of the first page. to view the full 2 pages of the document.
What is collision?
- When two keys are hashed into the same table location
- Can be solved using collision solution algorithm → linear probing
- Can be solved with chaining (call stack)
- Linear probing search in the direction of pink arrow
How does linear probing work? (inserting and searching)
How does search complexity work in hash table?
λ = n / T (where T is the size of hash table)
How does chaining work in hash table?
You're Reading a Preview
Unlock to view full version