Selgitage, mis on kokkupõrke olukord hash-funktsiooni kasutamisel ja kuidas see mõjutab hash-tabeli tööd.

Using a hash function, a collision occurs when different keys produce the same hash value. In a hash table, this means that multiple elements try to occupy the same cell.

Impact of collisions:

• The efficiency of insert, search, and delete operations decreases because multiple elements need to be processed in one cell.
• Methods such as chaining (linked lists) or open addressing are used to resolve collisions.

Example: if the hash function for keys "apple" and "pleap" returns the same index, both elements will be stored in the same bucket, and during search, all elements in that bucket must be checked, which reduces efficiency.