| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2017 |
| Session | January |
| Marks | 4 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Binary Search Execution |
| Difficulty | Easy -1.8 This is a straightforward application of the binary search algorithm to an alphabetical list, requiring only mechanical execution of a standard procedure with no problem-solving or mathematical insight. It's significantly easier than typical A-level pure maths questions, being purely algorithmic recall from D1. |
| Spec | 7.03c Working with algorithms: trace, interpret, adapt |
\begin{enumerate}
\item Use the binary search algorithm to try to locate the name Hilbert in the following alphabetical list. Clearly indicate how you chose your pivots and which part of the list is being rejected at each stage.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2017 Q1 [4]}}