Consider the following functions. f(n) = 2ng(n) = n!h(n) = nlog n
Which of the following statements is true?
Suppose you inserted the keys 12, 13, 7, 10, 22, 11, 20, 1, 5, 7, 25 into an open addressing hash table of size 13 using the hash function h(x) = (3 x + 7) mod 13 with linear probing. What is the load factor?