Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniquesHashing

Collision handling: probing

Theory

Linear probing insertion

Report a typo

We have the following hash table with 8 buckets, identity hash function and linear probing, with 0 meaning empty and -1 deleted. You want to insert 5 in it. In which bucket will it go?

Linear probing insertion

Do not worry about the load factor.

Select one option from the list
___

Create a free account to access the full topic