Linear probing
It does a linear search for an empty slot when a collision is identified
Advantages
Easy to implement
It always finds a location if there is one
Disadvantages
When clusters and keys fill most of the array after forming in adjacent slots of the table, the performance deteriorates
Double probing/hashing
The idea here is to make the offset to the next position probed depending on the key value. This is so it can be different for different keys.
Advantages
Good for double number generation
Smaller hash tables can be used.
Disadvantages
As the table fills up, the performance degrades.
Quadratic probing
It is used to resolve collisions in hash tables. It is an open addressing scheme in computer programming.
Advantage
It is more efficient for a closed hash table.
Disadvantage
Has secondary clustering. Two keys have same probe sequence when they hash to the same location.
They can hack into you email or your phone number thats all they need to find where you live how old you are and etc hope this helps
Answer:
Sorry this is a typing test, too pysical for online help as for the words and time limit to reinforced learning, if content is the issue grab an article or paper and type that.
it is a okkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
No longer produced or used; out of date.
