Please enable JavaScript.
Coggle requires JavaScript to display documents.
Hashing - Coggle Diagram
Hashing
Hash Table
Collisions
Extend and Re-hash
Create a new hash table that is bigger than the old one
Modify the hash function
Re-hash the numbers to the new hash table using the new hash function
Linear Probing
Uses the next available bucket to store the numbering collision
Separate Chaining
Chain of buckets is created at each position of the hash table
Time Complexity
Worst Case
all collisions
Best Case
no collisions
Hashing is the process of transforming a sequence of alphanumeric characters to a value
The algorithm in charge of carrying out the hashing process is known as the hash function. A hash function can be any function that is able to transform the input sequence into a value
The hash function receives as an input, a sequence of characters and returns a hash value
Applications
Password Security
verifying the integrity of content
information searches
