Why is a (collision-less) hashtable lookup really O(1)?
The hash function doesn't return some string such as mkwer. It directly returns the position of the item in the array. If, for example, your hash table has ten entries, the hash function will return an integer in the range 0&ndash;9.