Easy -1.8 This is a straightforward algorithmic execution question requiring only mechanical application of the binary search algorithm to a small, pre-sorted list. It involves simple arithmetic (finding midpoints) and alphabetical comparison, with no problem-solving, proof, or conceptual understanding beyond following the algorithm's steps.
2. Use the binary search algorithm to try to locate the name Hannah in the following alphabetical list. Clearly indicate how you selected your pivots and which part of the list is being rejected at each stage.
\begin{displayquote}
Adam
Ben
Charlie
Eleanor
Freya
Greg
Jenny
Richard
Toby
\end{displayquote}
2. Use the binary search algorithm to try to locate the name Hannah in the following alphabetical list. Clearly indicate how you selected your pivots and which part of the list is being rejected at each stage.
\begin{displayquote}
Adam\\
Ben\\
Charlie\\
Eleanor\\
Freya\\
Greg\\
Jenny\\
Richard\\
Toby
\end{displayquote}
\hfill \mbox{\textit{Edexcel D1 Q2 [4]}}