Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ? A. O(1) B. O(log n) C. O(n) D. O(n2)

Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ?

1. O(1)
2. O(log n)
3. O(n)
4. O(n2)

Answer & Explanation

Answer: Option D

TAGS:

Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ? A. O(1) B. O(log n) C. O(n) D. O(n2)Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ? A. O(1) B. O(log n) C. O(n) D. O(n2)Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ? A. O(1) B. O(log n) C. O(n) D. O(n2)