2,484 views
2 votes
2 votes

Solve this recurrence equation using Master's theorem

T(n) = 64 T(n/8) - n 2 log n

4 Answers

0 votes
0 votes

As this  N2logN Function is decreasing Master Theorem can not be applied here..

Related questions

0 votes
0 votes
1 answer
1
sh!va asked Dec 4, 2016
388 views
Solve given recurrence relation using Masters theorem:T(n) =T (n/2)+ n
2 votes
2 votes
2 answers
2
sh!va asked Oct 29, 2016
2,074 views
Solve using Masters theorem 2T (n/2) + n log n
2 votes
2 votes
1 answer
4