How to use master method or recursion problem in case of f(n)=n factorial
Question
How to solve T(n) =2T(n/2)+n. using master method or recursion.
1 answers
solution1
0 2021-10-03 18:42:24
The case is straightforward in master theorem. As log_2(2) = 1 and n \in O(n!) , the result will be T(n) \in Theta(n!) . Hence, T(n) \in O(n!) .
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Master theorem with f(n)=n!?
How to solve this recursion T(n) = 5T(n/2) + n^2 lg n using master's theorem?
Applying Master's Theorem with f(n) = 2^n
Master's theorem with f(n)=log n
master theorem f(n) = nlogn
Can i use master theorem if i have f(n) = logn
If f(n) contains some term of log(n), is it possible to solve this by the Master Method?
How to build the case for n=3 using bottom up recursion?
Find the value of f(n) in the master theorem
Can I apply the properties of big-O on f(n) in the case of T(n)=O(n^f(n))?
Related Tags