| Exam Board | OCR |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Session | Specimen |
| Marks | 8 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Shuttle Sort Execution |
| Difficulty | Easy -1.2 This is a straightforward algorithmic execution question requiring mechanical application of shuttle sort with no problem-solving or insight. Part (i) is pure procedural recall, and part (ii) asks for a standard definition of quadratic complexity. Both parts are routine textbook exercises well below average A-level difficulty. |
| Spec | 7.03k Sorting: quick sort |
| Answer | Marks | Guidance |
|---|---|---|
| (i) | Pass 1: 3 6 8 3 2; Pass 2: 3 6 3 8 2; Pass 3: 3 3 6 2 8; Pass 4: 3 2 3 6 8; (continue until) 2 3 3 6 8 | B1 each pass |
| (ii) | The number of comparisons/operations is proportional to \(n^2\) where \(n\) is the number of items; doubling the list size roughly quadruples the time/work | B1 (statement), B1 (explanation), B1 (context) |
# Question 3:
**(i)** | Pass 1: 3 6 8 3 2; Pass 2: 3 6 3 8 2; Pass 3: 3 3 6 2 8; Pass 4: 3 2 3 6 8; (continue until) 2 3 3 6 8 | B1 each pass | Award marks for each correct pass shown
**(ii)** | The number of comparisons/operations is proportional to $n^2$ where $n$ is the number of items; doubling the list size roughly quadruples the time/work | B1 (statement), B1 (explanation), B1 (context) | Must relate to $n^2$ relationship
---3 (i) Use the shuttle sort algorithm to sort the list
$$\begin{array} { l l l l l }
6 & 3 & 8 & 3 & 2
\end{array}$$
into increasing order. Write down the list that results from each pass through the algorithm.\\
(ii) Shuttle sort is a quadratic order algorithm. Explain briefly what this statement means.
\hfill \mbox{\textit{OCR D1 Q3 [8]}}