AI engineering glossary · Data structures algorithms
What is open addressing?
Open addressing (also called probing, linear probing): A method of handling collisions where all entries live in the array itself, and a colliding key is placed in another slot found by a probing sequence such as trying the next slot. It saves pointer memory but degrades sharply when the table is nearly full.
Open addressing: an example
If slot 5 is taken, linear probing tries slot 6, then 7, until a free slot is found. Lookup follows the same path.
Related terms
More Data structures algorithms terms
- Optimal substructure
- Overlapping subproblems
- P versus NP
- Polynomial time
- Prefix sum
- Prim's algorithm
- Priority queue
- Queue
Where you learn it
Open addressing is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.