Question

Which of the following are corrects?
A The worst-case complexity of quicksort is O(n2
B. The worst-case complexity of merge sort is O(nlogn)
C. The space complexity of merge sort is O(n)
D. None of the above​

Answer 1

Answer:

b) worst case complexity of merge Sort is O

Answer 2

Answer:

B.Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)