AQA D1 2005 June — Question 1 5 marks

Exam BoardAQA
ModuleD1 (Decision Mathematics 1)
Year2005
SessionJune
Marks5
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicSorting Algorithms
TypeShuttle Sort Execution
DifficultyEasy -1.8 This is a purely procedural question requiring mechanical execution of a standard shuttle sort algorithm with no problem-solving, insight, or conceptual understanding needed. Students simply follow the memorized steps to swap adjacent elements, making it significantly easier than average A-level questions which typically require some mathematical reasoning or application of multiple techniques.
Spec7.03k Sorting: quick sort

1 Use a shuttle sort algorithm to rearrange the following numbers into ascending order, showing the new arrangement after each pass. $$\begin{array} { l l l l l l l l } 23 & 3 & 17 & 4 & 6 & 19 & 14 & 3 \end{array}$$ (5 marks)

1 Use a shuttle sort algorithm to rearrange the following numbers into ascending order, showing the new arrangement after each pass.

$$\begin{array} { l l l l l l l l } 
23 & 3 & 17 & 4 & 6 & 19 & 14 & 3
\end{array}$$

(5 marks)

\hfill \mbox{\textit{AQA D1 2005 Q1 [5]}}