Q872
Solve the following recurrence using Master's theorem. T(n) = 2T (n/2) + n/ log n
A.
T(n) = O(n)
B.
T(n) = O(log n)
C.
T(n) = O(n2log n)
D.
cannot be solved using master's theorem
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board