Open Addressing

overview

Summary

A hash_table with open_addressing stores all keys in the array. A hash_function maps keys to indices. On a collision, it uses probing to find another slot: linear_probing, quadratic_probing, or double_hashing. Search, insert, and delete follow the same probe sequence. Keep the load_factor low for speed. Deletion often marks a tombstone instead of clearing. Periodic resizing rehashes entries to maintain performance. Clustering can appear, especially with linear_probing.