<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
a	O
jump	B-Algorithm
search	I-Algorithm
or	O
block	B-Algorithm
search	I-Algorithm
refers	O
to	O
a	O
search	B-Application
algorithm	I-Application
for	O
ordered	O
lists	O
.	O
</s>
<s>
To	O
find	O
the	O
exact	O
position	O
of	O
the	O
search	O
key	O
in	O
the	O
list	O
a	O
linear	B-Algorithm
search	I-Algorithm
is	O
performed	O
on	O
the	O
sublist	O
L[( 	O
k-1	O
)	O
m	O
,	O
km ]	O
.	O
</s>
<s>
This	O
is	O
better	O
than	O
a	O
linear	B-Algorithm
search	I-Algorithm
,	O
but	O
worse	O
than	O
a	O
binary	O
search	O
.	O
</s>
<s>
The	O
advantage	O
over	O
the	O
latter	O
is	O
that	O
a	O
jump	B-Algorithm
search	I-Algorithm
only	O
needs	O
to	O
jump	O
backwards	O
once	O
,	O
while	O
a	O
binary	O
can	O
jump	O
backwards	O
up	O
to	O
log	O
n	O
times	O
.	O
</s>
<s>
The	O
algorithm	O
can	O
be	O
modified	O
by	O
performing	O
multiple	O
levels	O
of	O
jump	B-Algorithm
search	I-Algorithm
on	O
the	O
sublists	O
,	O
before	O
finally	O
performing	O
the	O
linear	B-Algorithm
search	I-Algorithm
.	O
</s>
<s>
For	O
a	O
k-level	O
jump	B-Algorithm
search	I-Algorithm
the	O
optimum	O
block	O
size	O
ml	O
for	O
the	O
l	O
th	O
level	O
(	O
counting	O
from	O
1	O
)	O
is	O
n(k-l )	O
/k	O
.	O
</s>
