Timeline for $T(n)=2T(n/2)+n\log n$ and the Master theorem [duplicate]
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2014 at 13:12 | history | closed | Raphael | Duplicate of Solving or approximating recurrence relations for sequences of numbers | |
| Apr 13, 2014 at 13:10 | comment | added | Raphael | 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$. | |
| Apr 13, 2014 at 12:25 | answer | added | Tanmoy Banerjee | timeline score: 3 | |
| Apr 13, 2014 at 12:20 | review | First posts | |||
| Apr 13, 2014 at 13:14 | |||||
| Apr 13, 2014 at 12:18 | history | edited | FrankW | CC BY-SA 3.0 |
added 54 characters in body; edited tags; edited title
|
| Apr 13, 2014 at 12:15 | answer | added | FrankW | timeline score: 4 | |
| Apr 13, 2014 at 12:01 | history | asked | user16715 | CC BY-SA 3.0 |