However, the number of these operations depends on the size of the key, not on the size of the hash table into which the key is inserted: the number of operations to compute hash function is the same for a key in a table with ten or with ten thousand entries. That is why the call of hash function is often considered O (1).

For More Information Please Refer:

You May Also Like to Read: