Perform simulations to compare the observed performance of hashing with the theoretical results. Declare a probing hash table, insert 10,000 randomly generated integers into the table, and count the average number of probes used. This number is the average cost of a successful search. Repeat the test several times for a good average. Run it for both linear probing and quadratic probing, and do it for final load factors 0.1, 0.2, ..., 0.9. Always declare the table so that no rehashing is needed. Thus the test for load factor 0.4 would declare a table of size approximately 25,000 (adjusted to be prime). Needs to be written in Java

Implement integer hash table
Implement linar probing and quadratic probing
Insert 10K random ints into table
Tabluate the number of probes for each insertion
Report for load factors 0.1 to 0.9

Answer rating: 100% (QA)

import javautilRandom class HashTable private int tableSize private int table private int numElement... View the full answer