Answer
Perform a binary search on the list: $[\text { Arturo, Elsa, JoAnn, John, Jose, Lee, Snyder, Tracy }]$
We're searching for Tracy.
$\bullet$ begin $=$ Arturo; end $=$ Tracy; $m=$ John;
$\ \ \ $Compare John to Tracy. Tracy follows John.
$\ \ \ $Set begin to $m+1=$ Jose;
$\bullet$ begin $=$ Jose; $e n d=$ Tracy; $m=$ Lee;
$\ \ \ $Compare Lee to Tracy. Tracy follows Lee.
$\ \ \ $Set begin to $m+1=$ Snyder;
$\bullet$ begin $=$ Snyder; end $=$ Tracy; $m=$ Tracy;
$\ \ \ $Compare Tracy to Tracy. $m=$ Tracy
$\ \ \ $Set Found $=Y e s$ and stop the algorithm.
Work Step by Step
--
