Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniquesHashing

Collision handling: probing

Theory

Quadratic probing insertion

Report a typo

You have the following table with 8 buckets and identity hash function with quadratic probing with the function H(i)=h+i+i2H(i) = h + i +i^2 (0 for empty and -1 for deleted). You want to check if the value 8 is in it. How many buckets do you have to check before realizing it's not in there?

Quadratic probing insertion

Select one option from the list
___

Create a free account to access the full topic