Question: Which function can i choose for f(n) in the recursion T(n)=4T(n/2) + f(n), so that none of the three Master Theorems can solve the Recursion?
Which function can i choose for f(n) in the recursion T(n)=4T(n/2) + f(n), so that none of the three Master Theorems can solve the Recursion? And how can i prove it?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
