Q691
Solve the following recurrence using Master's theorem. T(n) = 4T (n/2) + n2
A.
T(n) = O(n)
B.
T(n) = O(log n)
C.
T(n) = O(n2log n)
AnswerD.
T(n) = O(n2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board