Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?
(A)
When elements are sorted in ascending order
(B)
When elements are sorted in descending order
(C)
When elements are not sorted by any order
(D)
There is no best case for Bubble Sort. It always takes O(n*n) time
Answer: (A)
Explanation:
In the best-case scenario, the array is already sorted, but just in case, bubble sort performs O(n) comparisons. As a result, the time complexity of bubble sort in the best-case scenario is O(n).
Hence Option(A) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post