| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2002 |
| Session | January |
| Marks | 7 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Binary Search Execution |
| Difficulty | Easy -1.8 This is a straightforward application of a standard algorithm with no problem-solving required. Part (i) is pure procedural execution of binary search on a small list, and part (ii) requires only the formula logâ‚‚(1000), which is typically given or memorized. Both parts are direct recall and mechanical application, making this significantly easier than average A-level questions. |
| Spec | 7.03c Working with algorithms: trace, interpret, adapt7.03h Best/worst/typical case: run-time analysis |
\begin{enumerate}[label=(\roman*)]
\item Use the binary search algorithm to try to locate the name $SABINE$ in the following alphabetical list. Explain each step of the algorithm.
\begin{align}
1. &\quad ABLE \\
2. &\quad BROWN \\
3. &\quad COOKE \\
4. &\quad DANIEL \\
5. &\quad DOUBLE \\
6. &\quad FEW \\
7. &\quad OSBORNE \\
8. &\quad PAUL \\
9. &\quad SWIFT \\
10. &\quad TURNER
\end{align}
[5]
\item Find the maximum number of iterations of the binary search algorithm needed to locate a name in a list of 1000 names. [2]
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2002 Q2 [7]}}