Answer
Perform a binary search on the list: $[\text { Arturo, Elsa, JoAnn, John, Jose, Lee, Snyder, Tracy }]$
We're searching for Emile.
$\bullet$ begin $=$ Arturo; end $=$ Tracy; $m=\mathrm{John}$
$\ \ \ $Compare John to Emile. Emile precedes John.
$\ \ \ $Set end to $m-1=$ JoAnn;
$\bullet$ begin $=$ Arturo; $e n d=$ JoAnn; $m=$ Elsa;
$\ \ \ $Compare Elsa to Emile. Emile follows Elsa (alphabetically).
$\ \ \ $Set begin to $m+1=$ JoAnn;
$\ \ \ $since beginning $=$ end set Found $=N o$ and stop the Algorithm.
Work Step by Step
--
