According to Introduction to algorithms by Cormen et al, $$T(n)=2T(n/2)+n\log n$$ is not case 3 of Master Theorem. Can someone explain me why?
And which case of master theorem is it?
Asked
Active
Viewed 2.5k times
6
-
Have you tried actually applying the Master theorem? (Note that the Master theorem can not solve all recurrences.) As for why case 3 does not apply, see here: $\log n \in o(n^{\varepsilon})$ for all $\varepsilon > 0$. – Raphael Apr 13 '14 at 13:10
2 Answers
4
$\log n$ grows slower than $n^\epsilon$ for any $\epsilon>0$. Thus $n\log n$ grows slower than $n^c$ for any $c>1$. However, the third case of the Master theorem requires the existance of a $c>1$ so that $n\log n$ grows at least as fast as $n^c$ (up to a constant factor).
The function is covered by the second case of the Master theorem as given in Wikipedia.
FrankW
- 6,589
- 4
- 26
- 42
-
-
1
-
-
1@tan How about you click on the link and read the version given in Wikipedia? If you still don't see, why that case applies, please give a specific objection. – FrankW Apr 13 '14 at 12:41
-
@FrankW: As $nlogn$ is not $\Theta(n)$, this recurrence can't be solved by second case of Master theorem(see my answer). – Tanmoy Banerjee Apr 13 '14 at 14:06
-
@tan $n\log n \in \Theta(n\log^k n)$ for $k=1\ge 0$. Thus the case is applicable. The condition you are quoting does not appear in the version of the Master theorem I am referencing. – FrankW Apr 13 '14 at 15:20
3
Case 3 of Master Theorem:
If $f(n)=\Omega(n^{\log_b a+\epsilon})$ for some constant $\epsilon > 0$, and if $f (n/b) ≤ cf (n)$ for some constant $c < 1$ and all sufficiently large $n$, then $T (n) = \Theta(f (n))$.
Here $f(n)=n\log n$ and $n^{\log_ba}=n^{\log_2 2}=n^1=n$. So $n^{log_ba+\epsilon}=n^{1+\varepsilon}$. But $n\log n$ is not $\Omega(n^{1+\epsilon})$.
So it is not under case 3. It is also not under second case: If $f(n)=\Theta(n^{\log_ba})$, then second case can be applied. But here $n^{\log_ba}=n$ and $f(n)=n\log n$ is not $\Theta(n)$.
This recurrence can't be solved by Master method.
David Richerby
- 81,689
- 26
- 141
- 235
Tanmoy Banerjee
- 928
- 2
- 12
- 24
-
1Please clarify this answer. I can think of at least three different ways that "n^log(b)a+$\varepsilon$" could be parsed. – David Richerby Apr 13 '14 at 12:38
-