JAVA code

For each of linear probing, quadratic probing, and double hashing do the following:

Hash 900 random numbers into a table of length 1009 using open addressing then add 50 more random integers currently not in the table to the table while counting the total number of probes for the last 50. Use the hash functions given

table length = m

linear and quadratic:

Auxiallary has function: h^'(k) = k

quadratic: c₁ = 1, c₂ = 3

Double Hashing:

h₁(k) = k

h₂(k) = 1 = (k mod (m - 1))