Question

The worst-case time complexity of Bubble Sort is________. A. O(n2) B. O(log n) C. O(n) D. O(n logn)

Answer 1

Answer:

A

Explanation:

because in bubble sort we use two for loop

each loop contains n times

so, now time complexity = O(n*n)

= O(n2)