Timeline for Recurrence relation for time complexity $T(n) = T(n-1) + n^2$
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 28, 2013 at 12:26 | comment | added | Igor Shinkar | @PratikDeoghare yes it does. because the function $f(i) = i^2$ is monotone. | |
| Jul 13, 2013 at 6:30 | comment | added | Pratik Deoghare | I love this method but it doesn't give you $\Omega$ bound. | |
| Jul 12, 2013 at 5:43 | history | answered | ramgorur | CC BY-SA 3.0 |