How does collision handling occur in hash tables when searching for elements?

When searching for elements in hash tables, collisions occur when different keys have the same hash value. Various methods are used to handle collisions:

• Chaining method: each slot in the table contains a linked list of elements with the same hash. When a collision occurs, the new element is added to the list.

• Open addressing: upon collision, the next free slot is searched according to a certain sequence (linear probing, quadratic probing, double hashing).

In Go, the built-in map implementation uses chaining with optimizations. When a collision occurs, elements with the same hash are stored in linked lists within buckets. This allows efficient searching, inserting, and deleting of elements.

A simplified logic example:

1. The hash of the key is computed.
2. The bucket index is determined by the hash.
3. If the bucket is empty, the element is inserted.
4. If the bucket is occupied, the linked list is traversed to find the key or add a new element.

This approach provides a balance between access speed and efficient memory usage.