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