Timeline for Master Theorem: How to find the value of b in this recurrence relation
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Sep 29, 2016 at 13:42 | answer | added | Euge | timeline score: 1 | |
| Sep 28, 2016 at 17:37 | answer | added | D.W.♦ | timeline score: 3 | |
| Sep 28, 2016 at 6:12 | comment | added | Raphael | Welcome to Computer Science! Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. | |
| Sep 28, 2016 at 6:12 | comment | added | Raphael |
You can also investigate how T and $T'$ given by $T'(n) = T'(n/4) + f(n)$ differ.
|
|
| Sep 28, 2016 at 6:11 | comment | added | Raphael | See our reference question for other methods you can apply. | |
| Sep 28, 2016 at 3:17 | history | tweeted | twitter.com/StackCompSci/status/780969605493907456 | ||
| Sep 28, 2016 at 2:27 | history | edited | EvaD | CC BY-SA 3.0 |
added 272 characters in body
|
| Sep 28, 2016 at 1:28 | answer | added | iLoveCamelCase | timeline score: 2 | |
| Sep 28, 2016 at 0:11 | review | First posts | |||
| Sep 28, 2016 at 1:55 | |||||
| Sep 28, 2016 at 0:11 | history | asked | EvaD | CC BY-SA 3.0 |