Which sorting algorithm has a worst-case time complexity of O(n2)?
PYQ IBPS SO CRP SPL-XIII (2023)
Which sorting algorithm has a worst-case time complexity of O(n2)?
- A.
Merge Sort
- B.
Radix Sort
- C.
Bubble Sort
- D.
Heap Sort
- E.
None of the above
Attempted by 61 students.
Sign up free to check your answer
Sign up freeLoading lesson…

