CS Edexcel 1.2d Bubble and Merge Sort

What does the bubble sort algorithm do when it compares two elements?

• It duplicates the smaller element
• It adds them together
• It removes the larger element
• It checks if they are in the correct order

In the bubble sort algorithm, what happens when two items are in the wrong order?

• They are sorted automatically
• They remain in their positions
• They are deleted from the list
• They are compared and swapped if necessary

The bubble sort must make (a)   to ensure the array is sorted.

• At least one pass without swaps
• At least one pass
• At least two passes
• At least three passes

What is the role of the temporary variable in the bubble sort?

• To hold a value during a swap
• To store the sorted array
• To count the number of swaps
• To compare two elements

What is the initial comparison made in a bubble sort?

• Any two random elements
• The last two elements of the list
• The middle elements of the list
• The first two elements of the list

What happens if the bubble sort algorithm does not make any swaps during a pass?

• It concludes that the array is sorted
• It starts the sorting process again
• It removes duplicates from the array
• It adds more elements to the array

Which of the following is NOT a characteristic of the bubble sort algorithm?

• It is an intelligent sorting algorithm
• It can sort numbers and strings
• It requires multiple passes for accuracy
• It compares and swaps elements as needed

What is the primary function of the bubble sort algorithm?

• To sort data by repeatedly comparing and swapping adjacent elements if they are in the wrong order.
• To sort data by dividing it into smaller sections and sorting each section individually.
• To sort data by comparing all elements at once and arranging them in order.
• To sort data by using a randomised approach without any comparisons.

What is the first step in the merge sort algorithm?

• To sort the items in descending order
• To compare the items in the array
• To split the data into individual items
• To merge the sorted pairs into a single array

In the merge sort process, what do we do after splitting the data into pairs?

• We sort the pairs in ascending order
• We merge all pairs into one list
• We compare all items in the list
• We discard the larger items