What is the primary function of a bubble sort algorithm?

• To reduce the size of a data set

• To merge two sorted lists into one

• To find the maximum value in a list

• To order an unordered list of items by comparing and swapping them if necessary

Which of the following best describes the efficiency of the bubble sort algorithm?

• Least efficient sorting algorithm

• Efficient for data sets that are already partially sorted

• Efficient only for large data sets

• Most efficient sorting algorithm

What condition must be met for the bubble sort's main while loop to continue executing?

• The list is empty

• All items are already sorted

• At least one swap has occurred

• No swaps are needed

In bubble sort, what happens when two items are out of order?

• They are left as is

• They are immediately moved to the correct position

• They are swapped

• A new list is created

What is the purpose of the 'swapped' boolean variable in the bubble sort algorithm?

• To track the number of iterations

• To count the number of swaps

• To indicate whether a swap has occurred

• To stop the algorithm

How does the bubble sort algorithm determine when the sorting process is complete?

• When the list has been iterated through once

• When the list is in ascending order

• When no more swaps can be made

• When all elements are equal

What is the initial setting of the 'swapped' variable at the start of the bubble sort algorithm?

• Undefined

• Null

• True

• False

Which of the following is NOT a step in the bubble sort algorithm?

• Swapping items if they are out of order

• Repeating the process until no swaps are needed

• Comparing each item with the next one

• Selecting the smallest item and moving it to the start

What does the bubble sort algorithm do each time through the while loop?

• Leaves 'n' unchanged

• Decreases the value of 'n' by one

• Increases the value of 'n' by one

• Resets 'n' to the length of the list

Which of the following is a correct statement about the bubble sort algorithm?

• It is ideal for very large data sets due to its efficiency

• It is often used because it is easy to implement and understand

• It does not require any comparisons between list items

• It sorts items in random order to increase unpredictability