<s>
A	O
ternary	B-Algorithm
search	I-Algorithm
algorithm	O
is	O
a	O
technique	O
in	O
computer	B-General_Concept
science	I-General_Concept
for	O
finding	O
the	O
minimum	O
or	O
maximum	O
of	O
a	O
unimodal	B-Algorithm
function	O
.	O
</s>
<s>
A	O
ternary	B-Algorithm
search	I-Algorithm
determines	O
either	O
that	O
the	O
minimum	O
or	O
maximum	O
cannot	O
be	O
in	O
the	O
first	O
third	O
of	O
the	O
domain	O
or	O
that	O
it	O
cannot	O
be	O
in	O
the	O
last	O
third	O
of	O
the	O
domain	O
,	O
then	O
repeats	O
on	O
the	O
remaining	O
two	O
thirds	O
.	O
</s>
<s>
A	O
ternary	B-Algorithm
search	I-Algorithm
is	O
an	O
example	O
of	O
a	O
divide	B-Algorithm
and	I-Algorithm
conquer	I-Algorithm
algorithm	I-Algorithm
(	O
see	O
search	B-Application
algorithm	I-Application
)	O
.	O
</s>
<s>
Let	O
be	O
a	O
unimodal	B-Algorithm
function	O
on	O
some	O
interval	O
.	O
</s>
