Question 1

What does Bubble Sort do if two adjacent elements are in the correct order?

Accepted Answer

It does not swap them.

Answer

It randomly shuffles them.

Answer

It removes one of the elements.

Answer

It always swaps them.

Question 2

What is the final sorted array after running Bubble Sort on [3, 1, 4, 2]?

Accepted Answer

[1, 2, 3, 4]

Answer

[2, 1, 3, 4]

Answer

[4, 3, 2, 1]

Answer

[1, 3, 2, 4]

Question 3

What does Bubble Sort do with the smallest elements in a list?

Accepted Answer

They 'bubble' to the top of the list.

Answer

They are placed at the bottom of the list.

Answer

They are removed from the list.

Answer

They are randomly rearranged.

Question 4

In the Bubble Sort process, when are adjacent elements swapped?

Accepted Answer

If they are in the wrong order.

Answer

If they are the same value.

Answer

If they are in ascending order.

Answer

If they are at even indices.

Question 5

Why is Bubble Sort named as such?

Accepted Answer

Because smaller elements 'bubble' to the top of the list.

Answer

Because it removes duplicate elements.

Answer

Because it always selects the largest element first.

Answer

Because it randomly sorts elements.

Question 6

What action does Bubble Sort take if elements are already in sorted order?

Accepted Answer

It performs unnecessary comparisons but eventually stops without making any swaps.

Answer

It reverses the order of elements.

Answer

It shuffles the elements.

Answer

It ignores the elements.

Question 7

Is Bubble Sort an efficient sorting algorithm for large datasets?

Accepted Answer

No, it has a time complexity of O(n^2) making it inefficient for large datasets.

Answer

Yes, it is the most efficient algorithm available.

Answer

Yes, it has a time complexity of O(log n).

Answer

No, it has a time complexity of O(n) making it efficient for large datasets.

Question 8

What would be an alternative to using Bubble Sort for sorting large datasets efficiently?

Accepted Answer

Using algorithms like Merge Sort or Quick Sort with lower time complexities.

Answer

Using Bubble Sort but increasing the number of comparisons.

Answer

Not sorting the datasets at all.

Answer

Continuing to use Bubble Sort with improved hardware.

Related quizzes