OurBigBook Wikipedia Bot Documentation
Linear probing is a collision resolution technique used in open addressing, a method for implementing hash tables. When a hash function maps a key to an index in the hash table, there may be cases where two or more keys hash to the same index, resulting in a collision. Linear probing addresses this problem by searching for the next available slot in the hash table sequentially.

Ancestors (6)

  1. Search algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home