What does a single step of the bubble sort algorithm involve?
Comparing adjacent pairs of values and swapping them regardless of whether they are in the wrong order.
Comparing adjacent pairs of values and moving the smaller one directly to the start of the list.
Comparing adjacent pairs of values and swapping them if they are in the wrong order.
Comparing non-adjacent pairs of values and swapping them if they are in the wrong order.
Flashcards for AQA AS Level Computer Science Sorting algorithms, covering the key terms and definitions you need to recall. 3 cards, matched to the AQA AS Level Computer Science (7516) specification.