Apa itu Open addressing?

Open addressing stores a hash table’s entries in one flat array: a key goes to the slot its hash selects or, if that slot is taken, to the next free one in a fixed probe sequence (linear probing: the following slots), and a lookup follows the same sequence until it finds the key or an empty slot.