Linear Probing
Probe sequence is
- h(k) mod size
- h(k) + 1 mod size
- h(k) + 2 mod size
- …
findEntry using linear probing:
bool findEntry(const Key & k, Entry *& entry) {
int probePoint = hash1(k);
entry = &table[probePoint];
probePoint = (probePoint + 1) % size;
} while (!entry->isEmpty() && entry->key != k);
return !entry->isEmpty();