KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
For master's theorem T(n) = a*T(n/b) + f(n) I am using 3 cases: If a*f(n/b) = c*f(n) for some constant c > 1 then T(n) = (n^log(b) a) If a*f(n/b) = f(n) then T(n) = (f(n) log(b) n) If a*f(n/b) = c*f(n) for some constant c < 1 then T(n) = (f(n)) But when f(n) = log n or n*log n , the value of c is dependent on value of n. How do I solve the recursive function using master's theorem?
Tags (comma-separated)
Save Edits
Cancel