Timeline for Recurrence relations and the Master Theorem
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2021 at 12:21 | vote | accept | kasra | ||
| Feb 5, 2021 at 10:50 | answer | added | Steven | timeline score: 1 | |
| Feb 5, 2021 at 10:06 | vote | accept | kasra | ||
| Feb 5, 2021 at 10:14 | |||||
| Feb 3, 2021 at 18:30 | comment | added | kasra | ok I will do that, thanks. | |
| Feb 3, 2021 at 8:07 | comment | added | Inuyasha Yagami | You can answer your own question if you have solved it. Just for the sake of completeness. | |
| Jan 30, 2021 at 18:39 | comment | added | kasra | yes, I'm really new to this stuff. Thanks very much :) | |
| Jan 30, 2021 at 18:35 | comment | added | Inuyasha Yagami | en.wikipedia.org/wiki/Stirling%27s_approximation. You asked something similar a few days before also. :) | |
| Jan 30, 2021 at 18:34 | comment | added | kasra | Thanks very much, but could please link to a proof of this? | |
| Jan 30, 2021 at 16:53 | comment | added | Inuyasha Yagami | Try using $\log (n!) = \Theta(n \log n)$. | |
| Jan 30, 2021 at 15:41 | history | asked | kasra | CC BY-SA 4.0 |