Question

The recurrence T(n) = 2T(n/2) + n is
of merge sort.
O 1)
best case
O2)
average case
3)
None of these
O 4)
worst case​

Answer 1

Answer:

None Of These Worst Case