What is the average complexity of the search operation for a slice and for a map in the Go language?

For a slice, the average complexity of searching for an element by value is O(n), where n is the number of elements in the slice. A linear search is necessary.

For a map, the average complexity of searching for an element by key is O(1). An implementation based on a hash table provides almost constant access time. In the worst case (for example, in case of hash collisions), the complexity can reach O(n), but in practice, this is a very rare occurrence.