<s>
Quadratic	B-Algorithm
probing	I-Algorithm
is	O
an	O
open	B-Algorithm
addressing	I-Algorithm
scheme	O
in	O
computer	B-General_Concept
programming	I-General_Concept
for	O
resolving	O
hash	B-Algorithm
collisions	I-Algorithm
in	O
hash	B-Algorithm
tables	I-Algorithm
.	O
</s>
<s>
Quadratic	B-Algorithm
probing	I-Algorithm
operates	O
by	O
taking	O
the	O
original	O
hash	B-Error_Name
index	O
and	O
adding	O
successive	O
values	O
of	O
an	O
arbitrary	O
quadratic	O
polynomial	O
until	O
an	O
open	O
slot	O
is	O
found	O
.	O
</s>
<s>
An	O
example	O
sequence	O
using	O
quadratic	B-Algorithm
probing	I-Algorithm
is	O
:	O
</s>
<s>
Quadratic	B-Algorithm
probing	I-Algorithm
can	O
be	O
a	O
more	O
efficient	O
algorithm	O
in	O
an	O
open	B-Algorithm
addressing	I-Algorithm
table	O
,	O
since	O
it	O
better	O
avoids	O
the	O
clustering	O
problem	O
that	O
can	O
occur	O
with	O
linear	B-Algorithm
probing	I-Algorithm
,	O
although	O
it	O
is	O
not	O
immune	O
.	O
</s>
<s>
It	O
also	O
provides	O
good	O
memory	O
caching	O
because	O
it	O
preserves	O
some	O
locality	B-General_Concept
of	I-General_Concept
reference	I-General_Concept
;	O
however	O
,	O
linear	B-Algorithm
probing	I-Algorithm
has	O
greater	O
locality	O
and	O
,	O
thus	O
,	O
better	O
cache	O
performance	O
.	O
</s>
<s>
Let	O
h(k )	O
be	O
a	O
hash	B-Error_Name
function	I-Error_Name
that	O
maps	O
an	O
element	O
k	O
to	O
an	O
integer	O
in	O
[0,m−1],	O
where	O
m	O
is	O
the	O
size	O
of	O
the	O
table	O
.	O
</s>
<s>
where	O
c2	O
≠	O
0	O
(	O
If	O
c2	O
=	O
0	O
,	O
then	O
h(k,i )	O
degrades	O
to	O
a	O
linear	B-Algorithm
probe	I-Algorithm
)	O
.	O
</s>
<s>
For	O
a	O
given	O
hash	B-Algorithm
table	I-Algorithm
,	O
the	O
values	O
of	O
c1	O
and	O
c2	O
remain	O
constant	O
.	O
</s>
<s>
For	O
,	O
where	O
m	O
,	O
n	O
,	O
and	O
p	O
are	O
integer	O
greater	O
or	O
equal	O
2	O
(	O
degrades	O
to	O
linear	B-Algorithm
probe	I-Algorithm
when	O
p	O
=	O
1	O
)	O
,	O
then	O
gives	O
cycle	O
of	O
all	O
distinct	O
probes	O
.	O
</s>
<s>
For	O
any	O
m	O
,	O
full	O
cycle	O
with	O
quadratic	B-Algorithm
probing	I-Algorithm
can	O
be	O
achieved	O
by	O
rounding	O
up	O
m	O
to	O
closest	O
power	O
of	O
2	O
,	O
compute	O
probe	O
index	O
:	O
,	O
and	O
skip	O
iteration	O
when	O
.	O
</s>
