Linear probing
Kent Quanrud · 24:21
Linear probing is a hash-table scheme that resolves collisions by walking to the next empty array cell rather than chaining. With a 5-wise independent hash function and table size \(m \ge 8n\), every operation has exp...