Computing Science Bubble Sort Quiz

What is the main idea behind bubble sort?

• Dividing the list into two sublists

• Repeatedly swapping adjacent elements if they are in the wrong order

• Rearranging elements based on a pivot

• Selecting the middle element as the pivot

Which of the following best describes the time complexity of bubble sort in the worst-case scenario?

• O(1)

• O(log n)

• O(n)

• O(n^2)

In bubble sort, after the first pass, _ is guaranteed to be at its correct position.

• Smallest element

• Largest element

• Middle element

• None of the above

Bubble sort is an example of a:

• Divide and Conquer algorithm

• Greedy algorithm

• Dynamic programming algorithm

• Sorting algorithm

Why is bubble sort considered inefficient for large lists?

• It requires extra space

• It has a time complexity of O(n)

• It has a quadratic time complexity

• It guarantees optimal sorting

The best-case time complexity of bubble sort is:

• O(1)

• O(log n)

• O(n)

• O(n^2)

When is bubble sort most suitable to use?

• When efficiency is the main concern

• When the list is already sorted

• When the list is small

• When memory usage is a priority

The term "bubble" in bubble sort refers to:

• Elements moving downwards in the list

• The way elements "float" to their correct position

• Sorting elements from smallest to largest

• Ignoring certain elements during sorting

In bubble sort, which pass is repeated until no swaps are needed?

• First pass

• Last pass

• Middle pass

• All passes

Bubble sort gets its name because:

• It bubbles up the largest element

• It bubbles up the smallest element

• Elements bubble up to their correct position

• Elements bubble down in the list