Can a hash table really be O ( 1 )?

Edit: To summarize what I learned: It is technically true because the hash function is not required to use all the information in the key and so could be constant time, and because a large enough table can bring collisions down to near constant time.
For More Information Please Refer:


You May Also Like to Read: