<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
an	O
exponential	B-Algorithm
search	I-Algorithm
(	O
also	O
called	O
doubling	O
search	O
or	O
galloping	O
search	O
or	O
Struzik	O
search	O
)	O
is	O
an	O
algorithm	O
,	O
created	O
by	O
Jon	O
Bentley	O
and	O
Andrew	O
Chi-Chih	O
Yao	O
in	O
1976	O
,	O
for	O
searching	O
sorted	O
,	O
unbounded/infinite	O
lists	O
.	O
</s>
<s>
Exponential	B-Algorithm
search	I-Algorithm
can	O
also	O
be	O
used	O
to	O
search	O
in	O
bounded	O
lists	O
.	O
</s>
<s>
Exponential	B-Algorithm
search	I-Algorithm
can	O
even	O
out-perform	O
more	O
traditional	O
searches	O
for	O
bounded	O
lists	O
,	O
such	O
as	O
binary	O
search	O
,	O
when	O
the	O
element	O
being	O
searched	O
for	O
is	O
near	O
the	O
beginning	O
of	O
the	O
array	B-Data_Structure
.	O
</s>
<s>
This	O
is	O
because	O
exponential	B-Algorithm
search	I-Algorithm
will	O
run	O
in	O
O(logi )	O
time	O
,	O
where	O
i	O
is	O
the	O
index	O
of	O
the	O
element	O
being	O
searched	O
for	O
in	O
the	O
list	O
,	O
whereas	O
binary	O
search	O
would	O
run	O
in	O
O(logn )	O
time	O
,	O
where	O
n	O
is	O
the	O
number	O
of	O
elements	O
in	O
the	O
list	O
.	O
</s>
<s>
Exponential	B-Algorithm
search	I-Algorithm
allows	O
for	O
searching	O
through	O
a	O
sorted	O
,	O
unbounded	O
list	O
for	O
a	O
specified	O
input	O
value	O
(	O
the	O
search	O
"	O
key	O
"	O
)	O
.	O
</s>
<s>
Bentley	O
and	O
Yao	O
suggested	O
several	O
variations	O
for	O
exponential	B-Algorithm
search	I-Algorithm
.	O
</s>
<s>
The	O
asymptotic	O
runtime	O
does	O
not	O
change	O
for	O
the	O
variations	O
,	O
running	O
in	O
O(logi )	O
time	O
,	O
as	O
with	O
the	O
original	O
exponential	B-Algorithm
search	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
Also	O
,	O
a	O
data	O
structure	O
with	O
a	O
tight	O
version	O
of	O
the	O
dynamic	B-Data_Structure
finger	I-Data_Structure
property	I-Data_Structure
can	O
be	O
given	O
when	O
the	O
above	O
result	O
of	O
the	O
k-nested	O
binary	O
search	O
is	O
used	O
on	O
a	O
sorted	O
array	B-Data_Structure
.	O
</s>
<s>
An	O
algorithm	O
based	O
on	O
exponentially	O
increasing	O
the	O
search	O
band	O
solves	O
global	B-Algorithm
pairwise	I-Algorithm
alignment	I-Algorithm
for	O
O(ns )	O
,	O
where	O
n	O
is	O
the	O
length	O
of	O
the	O
sequences	O
and	O
s	O
is	O
the	O
edit	O
distance	O
between	O
them	O
.	O
</s>
