What is the worst-case complexity of operations with a map during collisions?

In Go, a map is implemented based on a hash table with open addressing and chaining to resolve collisions. On average, insert, search, and delete operations have an amortized complexity of O(1). However, in the worst case, when many collisions occur and all elements end up in one chain, the complexity can degrade to O(n), where n is the number of elements in the map.

Nevertheless, the standard implementation of Go includes mechanisms for rehashing and redistribution, which minimize the likelihood of such a scenario. Therefore, in practice, the worst case is extremely rare.