Fill in the blank arrays to show the steps involved in applying the bubble sort algorithm to the array [4, 2, 5, 1, 3]. You only need to show the missing steps where a change is applied to the array.
| 4 | 2 | 5 | 1 | 3 |
| 1 | 2 | 3 | 4 | 5 |
Practise AQA GCSE Computer Science Sorting algorithms with exam-style questions for GCSE Computer Science. 62 questions, matched to the AQA GCSE Computer Science (8525) specification and written in Paper 1 and Paper 2 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.