<s>
Open	B-Algorithm
addressing	I-Algorithm
,	O
or	O
closed	B-Algorithm
hashing	I-Algorithm
,	O
is	O
a	O
method	O
of	O
collision	O
resolution	O
in	O
hash	O
tables	O
.	O
</s>
<s>
Linear	B-Algorithm
probing	I-Algorithm
in	O
which	O
the	O
interval	O
between	O
probes	O
is	O
fixed	O
—	O
often	O
set	O
to	O
1	O
.	O
</s>
<s>
Quadratic	B-Algorithm
probing	I-Algorithm
in	O
which	O
the	O
interval	O
between	O
probes	O
increases	O
quadratically	O
(	O
hence	O
,	O
the	O
indices	O
are	O
described	O
by	O
a	O
quadratic	O
function	O
)	O
.	O
</s>
<s>
Double	B-Algorithm
hashing	I-Algorithm
in	O
which	O
the	O
interval	O
between	O
probes	O
is	O
fixed	O
for	O
each	O
record	O
but	O
is	O
computed	O
by	O
another	O
hash	O
function	O
.	O
</s>
<s>
The	O
main	O
trade	O
offs	O
between	O
these	O
methods	O
are	O
that	O
linear	B-Algorithm
probing	I-Algorithm
has	O
the	O
best	O
cache	B-General_Concept
performance	I-General_Concept
but	O
is	O
most	O
sensitive	O
to	O
clustering	O
,	O
while	O
double	B-Algorithm
hashing	I-Algorithm
has	O
poor	O
cache	B-General_Concept
performance	I-General_Concept
but	O
exhibits	O
virtually	O
no	O
clustering	O
;	O
quadratic	B-Algorithm
probing	I-Algorithm
falls	O
in-between	O
in	O
both	O
areas	O
.	O
</s>
<s>
Double	B-Algorithm
hashing	I-Algorithm
can	O
also	O
require	O
more	O
computation	O
than	O
other	O
forms	O
of	O
probing	O
.	O
</s>
<s>
Hopscotch	B-Algorithm
hashing	I-Algorithm
,	O
</s>
<s>
last-come-first-served	O
hashing	O
and	O
cuckoo	B-Algorithm
hashing	I-Algorithm
move	O
existing	O
keys	O
around	O
in	O
the	O
array	O
to	O
make	O
room	O
for	O
the	O
new	O
key	O
.	O
</s>
<s>
A	O
critical	O
influence	O
on	O
performance	O
of	O
an	O
open	B-Algorithm
addressing	I-Algorithm
hash	O
table	O
is	O
the	O
load	O
factor	O
;	O
that	O
is	O
,	O
the	O
proportion	O
of	O
the	O
slots	O
in	O
the	O
array	O
that	O
are	O
used	O
.	O
</s>
<s>
Generally	O
typical	O
load	O
factors	O
with	O
most	O
open	B-Algorithm
addressing	I-Algorithm
methods	O
are	O
50%	O
,	O
whilst	O
separate	O
chaining	O
typically	O
can	O
use	O
up	O
to	O
100%	O
.	O
</s>
<s>
The	O
following	O
pseudocode	B-Language
is	O
an	O
implementation	O
of	O
an	O
open	B-Algorithm
addressing	I-Algorithm
hash	O
table	O
with	O
linear	B-Algorithm
probing	I-Algorithm
and	O
single-slot	O
stepping	O
,	O
a	O
common	O
approach	O
that	O
is	O
effective	O
if	O
the	O
hash	O
function	O
is	O
good	O
.	O
</s>
<s>
At	O
this	O
point	O
in	O
the	O
pseudocode	B-Language
,	O
is	O
a	O
vacant	O
slot	O
that	O
might	O
be	O
invalidating	O
this	O
property	O
for	O
subsequent	O
records	O
in	O
the	O
cluster	O
.	O
</s>
