Consider using a hash table for searching. If the table is s…
Consider using a hash table for searching. If the table is sufficiently large and the hash function is very good, what can we expect in terms of search time? Hint: Think Big-O. Hint 2: Think no collisions.