what is hashing
an ADT which would be able to find any data set almost instanley
How is the address for data determined in hashing?
Address = key mod (number of slots)
What is an important feature of a good hashing algorithm?
A good hashing algorithm should distribute data uniformly to minimize collisions.
What happens in a collision during hashing?
A collision occurs when two different keys are assigned the same address by the hashing algorithm.