The goal of hashing is to produce a search that takes
(a) O(1) time
(b) O(n2 )time
(c) O(log n ) time
(d) O(n log n ) time
This question was posed to me in a job interview.
The query is from Hashing techniques in portion Indexing and Hashing of Database Management