| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2013 |
| Session | Specimen |
| Marks | 8 |
| 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 the quick sort algorithm followed by binary search. It involves no problem-solving, mathematical insight, or novel thinking—just following a memorized algorithm step-by-step with alphabetical ordering, which is even simpler than numerical sorting. |
| Spec | 7.03c Working with algorithms: trace, interpret, adapt7.03k Sorting: quick sort |
|
|
|
|
|
|
|
|
|
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| First pass correct (N identified) | M1 | |
| All seven non-rejected items correct | A1 | |
| Correct with follow-through | A1ft | |
| List sorted, final answer (J) | A1 cso |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| First pass correct (N identified) | M1 | |
| (L S) correct | A1 | |
| (A V) correct follow-through | A1ft | |
| (H) final answer | A1 cso |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| First pass correct (H identified) | M1 | |
| (V) correct | A1 | |
| (L), (N) correct follow-through | A1ft | |
| (S) final answer | A1 cso |
# Question 1: Bubble Sort (Alternative Solutions)
## Middle Right
| Answer | Marks | Guidance |
|--------|-------|----------|
| First pass correct (N identified) | M1 | |
| All seven non-rejected items correct | A1 | |
| Correct with follow-through | A1ft | |
| List sorted, final answer (J) | A1 cso | |
## Middle Left
| Answer | Marks | Guidance |
|--------|-------|----------|
| First pass correct (N identified) | M1 | |
| (L S) correct | A1 | |
| (A V) correct follow-through | A1ft | |
| (H) final answer | A1 cso | |
## First
| Answer | Marks | Guidance |
|--------|-------|----------|
| First pass correct (H identified) | M1 | |
| (V) correct | A1 | |
| (L), (N) correct follow-through | A1ft | |
| (S) final answer | A1 cso | |
---1.
\begin{center}
\begin{tabular}{ | c | c | c | c | c | c | c | c | c | }
\hline
\begin{tabular}{ c }
Hajra \\
$( \mathrm { H } )$ \\
\end{tabular} & \begin{tabular}{ c }
Vicky \\
$( \mathrm { V } )$ \\
\end{tabular} & \begin{tabular}{ c }
Leisham \\
$( \mathrm { L } )$ \\
\end{tabular} & \begin{tabular}{ c }
Alice \\
$( \mathrm { A } )$ \\
\end{tabular} & \begin{tabular}{ c }
Nicky \\
$( \mathrm { N } )$ \\
\end{tabular} & \begin{tabular}{ c }
June \\
$( \mathrm { J } )$ \\
\end{tabular} & \begin{tabular}{ c }
Sharon \\
$( \mathrm { S } )$ \\
\end{tabular} & \begin{tabular}{ c }
Tom \\
$( \mathrm { T } )$ \\
\end{tabular} & \begin{tabular}{ c }
Paul \\
$( \mathrm { P } )$ \\
\end{tabular} \\
\hline
\end{tabular}
\end{center}
The table shows the names of nine people.
\begin{enumerate}[label=(\alph*)]
\item Use a quick sort to produce the list of names in ascending alphabetical order.
You must make your pivots clear.
\item Use the binary search algorithm on your list to locate the name Paul.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2013 Q1 [8]}}