Question: Given an initially empty hash table HT with length 7, together with a hash function H(k)=k%7. Let us use linear probing to solve collisions. What
Given an initially empty hash table HT with length 7, together with a hash function H(k)=k%7. Let us use linear probing to solve collisions. What is the average search length for successful searches after inserting 22, 43, 15 one by one into HT? Correct answer is 2, but how to count? Is there anny formula? Please give full explanation.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
