The algorithm below is called:

bool found $=$ false;

int low $=0,$ pos $=0,$ high $=$ size $-1$;

while $($low $<=$ high && $!$found$)$

$\{$

pos $=($low $+$ high$)/2$; $//$ Midpoint of the subsequence

if $($values$[$pos$]==$ searched$\_$value$)\{$ found $=$ true; $\}$

else if $($values$[$pos$]<$ searched$\_$value$)$

$\{$ low $=$ pos $+1$; $\}//$ Look in second half

else

$\{$ high $=$ pos $-1$; $\}//$ Look in first half

$\}$