Summary

A hash_table stores key-value pairs in an array. With linear_probing, on collisions you check the next slot, forming a probe_sequence that wraps using modulo. This is open_addressing. Typical operations are average O(1) when the load_factor is low. High load causes primary_clustering and longer probes. Deletions use a tombstone marker instead of clearing a slot. Maintain a good hash_function. Resize and rehash when the load_factor passes a threshold. Searching stops at an empty slot or the target key.