What is the time complexity of the following recurrence relation? T(n) =…
What is the time complexity of the following recurrence relation?
T(n) = 2T(n/2) + n log n, n ≥ 2
T(1) = 0
- A.
O(n(log n)2)
- B.
O(n)
- C.
O(n log n)
- D.
O(n2)
Attempted by 48 students.
Sign up free to check your answer
Sign up freeLoading lesson…