Question: Exercise 1 - Hash tables (30 pts) a) Insert the following keys in a hash table of size 13: 38, 12, 0, 26, 17, 52,
Exercise 1 - Hash tables (30 pts) a) Insert the following keys in a hash table of size 13: 38, 12, 0, 26, 17, 52, 61. You may use the hash function h(x) = 7 - x mod 7 to resolve collisions. b) What is the overall running time of your algorithm? Does sorting the elements first improve it
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
