Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

Master theorem with f(n)=n!?

How do I solve the following as f(n)=n! does not as to my knowledge apply to any of the cases of master theorem. T (n) = 16T (n/4) + n!

like image 233
Harshitha G Avatar asked Feb 27 '26 02:02

Harshitha G


1 Answers

David Eisenstat is partially correct. Case 3 does apply, but T(n) = theta(n!), not O(n!).

T(n) = 16T(n/4) + n!

Case 3 of the Master Theorem (AKA Master Method) applies. a = 16, b = 4, f(n) = n!. n^(log [base(b)] a) = n^2. f(n) is n!. Since n! is omega(f(n)) i.e. n! omega n^2 AND af(n/b) <= cf(n) for a large n, T(n) is theta(n!).

For reference, consult #10 here : http://www.csd.uwo.ca/~moreno/CS433-CS9624/Resources/master.pdf

like image 97
Jay ARe Avatar answered Mar 01 '26 18:03

Jay ARe



Donate For Us

If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!