What is the approximate time complexity for searching elements in a Map data structure?

In Go, the data structure Map is implemented as a hash table, so the average search time for an element in a Map is approximately O(1) — constant time.

This means that access to an element by key is very fast, regardless of the size of the Map. However, in the worst case (with many collisions), the time can degrade to O(n), but such situations are rare with good hashing.

Example of using Map in Go:

m := make(map[string]int)
m["apple"] = 5
value, exists := m["apple"]
if exists {
    fmt.Println("Value:", value)
}