Timeline for Time complexity of the fast exponentiation method
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2016 at 12:00 | comment | added | Yuval Filmus | You'll have to be creative. | |
| Jul 22, 2016 at 11:57 | comment | added | Aditya pratap singh | Ok ! when we have a two case relation like $$T(n) = \begin{cases} 0 & n = 0 \\ T(n-1) + 1 & \text{ otherwise} \end{cases}$$ then it become easier to compute Big-O by expanding .How do I compute big-O by expansion for the relation you told me..... | |
| Jul 22, 2016 at 11:49 | vote | accept | Aditya pratap singh | ||
| Jul 22, 2016 at 9:11 | history | answered | Yuval Filmus | CC BY-SA 3.0 |