Insertion in O(1) time

tableInsert(Object newItem) { int location = calculateAddress(newItem); array[location] = newItem; }
Search and deletion are similar.
As long as calculateAddress runs in O(1) time then the basic operations of insertion, deletion and searching in a hash table also run in O(1) time.

tableInsert(Object newItem) { int location = calculateAddress(newItem); array[location] = newItem; }