Bubble Sort in C MCQ Exercise 1

1. What is the worst-case time complexity of a Bubble Sort?

1. O(n)s
2. O(n log n)
3. O(n^2)
4. O(log n)

2. Which of the following will terminate the Bubble Sort easily?

1. When there are no swaps in a pass.
2. When the whole array is traversed once.
3. After doing a fixed number of iterations.
4. None of the above.

3. Which of the following is true about the Bubble Sort in C?

1. It will use additional memory proportional to the input size.
2. It is an in-place sorting algorithm.
3. It guarantees O(n) time complexity.
4. It can be used for large datasets more efficiently.

4. What could be the primary disadvantage of the Bubble Sort?

1. It isn't very easy to implement.
2. It needs more additional memory.
3. It has the highest average time complexity.
4. It is unstable.

5. What kind of Bubble Sort data can perform very poorly?

1. Sorted data
2. Data was sorted in reverse order.
3. Random data
4. All of the above

6. What is the output of the following program?

1. 12458
2. 51428
3. 84215
4. 54218