in hash map is insertion and searching complexity O(1) or equal to complexity of hash function being used?
