Card 1 of 3
What does a single step of the bubble sort algorithm involve?
A
Comparing adjacent pairs of values and swapping them regardless of whether they are in the wrong order.
B
Comparing adjacent pairs of values and moving the smaller one directly to the start of the list.
C
Comparing adjacent pairs of values and swapping them if they are in the wrong order.
D
Comparing non-adjacent pairs of values and swapping them if they are in the wrong order.
Card 1 of 3
Sorting algorithms Flashcards
3 flashcards on AQA AS Level Computer Science Sorting algorithms: the key terms and definitions you need to recall.