| Exam Board | Edexcel |
|---|
| Module | FD1 (Further Decision 1) |
|---|
| Session | Specimen |
|---|
| Topic | Sorting Algorithms |
|---|
- A list of \(n\) numbers needs to be sorted into descending order starting at the left-hand end of the list.
- Describe how to carry out the first pass of a bubble sort on the numbers in the list.
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. - Estimate the time it would take the computer to apply a bubble sort to a list of 50000 numbers. Make your method clear.