Understanding Bubble Sort Algorithm

What is the primary characteristic of a bubble sort algorithm?

• It is suitable for large lists.

• It is the most efficient sorting algorithm.

• It involves swapping elements to sort a list.

• It does not require any comparisons.

How does bubble sort determine if a list is sorted?

• By checking if all elements are the same.

• By making a pass without any swaps.

• By comparing each element to the first one.

• By sorting the list in one pass.

What happens after each pass in a bubble sort?

• The algorithm stops.

• The largest element is in its final position.

• The smallest element is in its final position.

• A new list is created.

What is the initial action in a bubble sort algorithm?

• The first value is compared with the next one.

• The list is divided into two parts.

• All elements are swapped once.

• The list is reversed.

What indicates the end of the bubble sort process?

• When a pass results in no swaps.

• When the list is divided.

• After a set number of passes.

• When all elements are the same.

What is the efficiency of bubble sort on large lists?

• Highly efficient

• Moderately efficient

• Inefficient

• Depends on the list content

How does bubble sort compare elements?

• Two adjacent elements at a time

• From last to first

• In random order

• All elements to a pivot

What is the role of the 'swapped' variable in bubble sort?

• To hold the largest value

• To indicate if a swap occurred

• To store the list length

• To count the number of passes

What does each pass through the list accomplish in bubble sort?

• It ensures the highest element moves to its correct position.

• It sorts the entire list.

• It finds the smallest element.

• It reverses the list.