How is the efficiency of searching for an element in a Map data structure evaluated in terms of algorithmic complexity?

In Go, the data structure map is implemented as a hash table. The efficiency of searching for an element in a map is usually estimated as O(1) — constant time, assuming a uniform distribution of hashes.

However, in the worst case, such as in collisions, the complexity can degrade to O(n), where n is the number of elements. In practice, thanks to good implementation and hash functions, the search is very fast and close to O(1).