| Exam Board | Edexcel |
|---|---|
| Module | FD1 (Further Decision 1) |
| Session | Specimen |
| Marks | 4 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Algorithm Order and Complexity |
| Difficulty | Easy -1.2 Part (a) requires simple recall of the bubble sort algorithm definition. Part (b) is a straightforward application of quadratic scaling (ratio of squares), requiring only basic proportional reasoning with no conceptual difficulty. This is routine algorithmic complexity work well below average A-level problem-solving demands. |
| Spec | 7.03f Worst case complexity: T(n) as function of problem size7.03j Sorting: bubble sort and shuttle sort |
\begin{enumerate}
\item A list of $n$ numbers needs to be sorted into descending order starting at the left-hand end of the list.\\
(a) Describe how to carry out the first pass of a bubble sort on the numbers in the list.
\end{enumerate}
Bubble sort is a quadratic order algorithm.\\
A computer takes approximately 0.021 seconds to apply a bubble sort to a list of 2000 numbers.\\
(b) Estimate the time it would take the computer to apply a bubble sort to a list of 50000 numbers. Make your method clear.\\
\hfill \mbox{\textit{Edexcel FD1 Q1 [4]}}