480 views
1 votes
1 votes
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1,  b>1, k>=0 and p= any real number are satisfied.

My doubt is that if k= not a constant( eg: n^n), then can we apply the theorem since we know n will always be positive so k will be positive only?

2 Answers

Related questions

0 votes
0 votes
1 answer
1
lolster asked Jun 12, 2019
1,270 views
How to check if a given recurrence relation is in a format that is valid to apply Master’s Theorem? Also, how to distinguish between Master’s Theorem and extended Mas...
0 votes
0 votes
0 answers
3
pradeepchaudhary asked Aug 20, 2018
885 views
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
0 votes
0 votes
2 answers
4
manvi_agarwal asked Aug 10, 2018
1,663 views
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2