Component 2: Computational Thinking, Algorithms and Programming GCSE Computer Science Worksheets, Questions and Revision

An array called nums contains the values [4, 1, 7, 3], to be sorted into ascending order using a bubble sort that compares and swaps adjacent items. Show the state of the array after each comparison in the first full pass.

1. Compare index 0 and 1 (4 and 1): 4 is greater than 1, so swap, giving [1, 4, 7, 3].
2. Compare index 1 and 2 (4 and 7): 4 is not greater than 7, so no swap, array stays [1, 4, 7, 3].
3. Compare index 2 and 3 (7 and 3): 7 is greater than 3, so swap, giving [1, 4, 3, 7].
4. Final answer: after the first pass, the array is [1, 4, 3, 7].