Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniquesHashing

Collision handling: probing

Strategies to handle collisions

Report a typo

Here are some strategies to cope with collisions. Match their names with the explanations.

Match the items from left and right columns

Load Factor

Chaining

Linear Probing

Quadratic Probing

Make sure there are always more buckets than elements in the hash table.

In the case of a collision, search for an empty bucket using a formula which tells you how much to jump at each step.

Implement buckets as linked lists to allow more elements in one bucket.

In the case of a collision, search for the first empty bucket to the right and place the element there.

___

Create a free account to access the full topic