| Exam Board | AQA |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2006 |
| Session | June |
| Marks | 8 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Shuttle Sort Execution |
| Difficulty | Easy -1.8 This is a purely procedural question requiring mechanical execution of a standard algorithm with no problem-solving, insight, or mathematical reasoning. Students simply follow the shuttle sort steps and count operations—significantly easier than typical A-level questions that require applying mathematical concepts. |
| Spec | 7.03j Sorting: bubble sort and shuttle sort |
2
\begin{enumerate}[label=(\alph*)]
\item Use a shuttle sort to rearrange the following numbers into ascending order.
$$\begin{array} { l l l l l l l l }
18 & 2 & 12 & 7 & 26 & 19 & 16 & 24
\end{array}$$
\item State the number of comparisons and swaps (exchanges) for each of the first three passes.
\end{enumerate}
\hfill \mbox{\textit{AQA D1 2006 Q2 [8]}}