1,494 views
0 0 votes
On which of the following recurrence relation Master Theorem cannot be applied?

a)  T(n)=2T(n/2)+nlogn

b)  T(n)=T(n/2)+1

c)  T(n)=8T(n/2)+logn

d)  T(n)=7T(n/4)+n^2

Please log in or register to answer this question.

Position:
Show:

Related questions

5 5 votes
4 4 answers
1.1k
1.1k views
NullPointer_Pro asked Dec 24, 2025
1,142 views
Consider the following recurrence relation describing the running time of an algorithm: $$T(n) = 2T\left(\frac{n}{2}\right) + \frac{n}{\log n}$$$$(Base\ condition: T(1) =...
0 0 votes
1 1 answer
314
314 views
arbpass asked Sep 11, 2025
314 views
How to check if f(n) is polynomially greater than g(n)?
1 1 vote
1 1 answer
1.8k
1.8k views
mdboi asked Oct 29, 2022
1,792 views
how do i apply master theorem to this?
1 1 vote
2 2 answers
1.6k
1.6k views
mdboi asked Oct 28, 2022
1,550 views
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n