What is a hash table?

Maps keys to values in O(1) average.

A hash table stores key-value pairs and provides O(1) average access time.

A key is converted to an index by a hash function. The value is stored at that index.

Hash function

A hash function converts a key to a fixed-size index. A good hash function reduces collisions.

A common method: index = hash(key) % size. This ensures the index does not exceed the table size.

Write hash_func(key, size). Return key % size. Print 1 with print(hash_func(15, 7)).

Show example solution

def hash_func(key, size):
    # Compute hash
    return key % size
print(hash_func(15, 7))

Index computation

index = hash(key) % ____

Show answer

index = hash(key) % size