| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2003 |
| Session | June |
| Marks | 9 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Quick Sort Execution |
| Difficulty | Easy -1.8 This is a purely procedural question requiring mechanical application of two standard algorithms (quicksort and binary search) with no problem-solving, insight, or mathematical reasoning. Students simply follow memorized steps on a small dataset, making it significantly easier than typical A-level questions that require conceptual understanding or multi-step reasoning. |
| Spec | 7.03a Algorithm definition: input, output, deterministic, finite7.03k Sorting: quick sort |
The following list gives the names of some students who have represented Britain in the International Mathematics Olympiad.
Roper $(R)$, Palmer $(P)$, Boase $(B)$, Young $(Y)$, Thomas $(T)$, Kenney $(K)$, Morris $(M)$, Halliwell $(H)$, Wicker $(W)$, Garesalingam $(G)$.
\begin{enumerate}[label=(\alph*)]
\item Use the quick sort algorithm to sort the names above into alphabetical order.
[5]
\item Use the binary search algorithm to locate the name Kenney.
[4]
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2003 Q4 [9]}}