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