Consider using a hash table for searching. If the table is…
Consider using a hash table for searching. If the table is absolutely too small, and the hash function is really horrible, what can we expect in terms of search time? Hint: Think Big-O. Hint 2: Think lots of collisions.