Question

consider a hypothetical situation wherein you have infinite memory available and have millions of elements then which sorting algorithm is the best suited for the situation
options :
selection sort
merge sort
insertion sort
counting sort ​

Answer 1

Answer:

Question 1

What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?

A

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

B

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

C

Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn)

D

Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn)

please Mark me as brainlest Pleazzzzzz