Timeline for Is there a system behind the magic of algorithm analysis?
Current License: CC BY-SA 3.0
15 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/
|
|
Mar 16, 2017 at 15:50 | history | edited | CommunityBot |
replaced http://meta.cs.stackexchange.com/ with https://cs.meta.stackexchange.com/
|
|
Apr 10, 2015 at 21:10 | history | edited | D.W.♦ | CC BY-SA 3.0 |
Add a tag, to make it more likely that this will come up as related when people ask questions about running time analysis. Clarify the question to make it clearer to new folks what situations this might apply to.
|
Jan 28, 2015 at 20:07 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |
added 16 characters in body
|
Jan 28, 2015 at 17:01 | answer | added | Ari Trachtenberg | timeline score: 10 | |
Oct 14, 2014 at 9:06 | comment | added | Raphael | @babou I don't known what "normal" means here. From my point of view, the Master theorem has no business being here: this is about analysing algorithms, the Master theorem is a very specific tool for solving (some) recurrences (and very roughly at that). Since the mathematics have been covered elsewhere (e.g. here) I have elected to cover only the part from algorithm to mathematics here. I give references to posts that deal with working the mathematics in my answer. | |
Oct 12, 2014 at 14:33 | comment | added | babou | I am not especially competent on this, but is it normal that there is no reference to the Master theorem in any anwer? | |
Apr 13, 2014 at 10:23 | comment | added | Raphael | This question needs an answer that shows how to tackle non-additive cost measure, e.g. memory usage. | |
Apr 12, 2014 at 7:31 | comment | added | Raphael | @hadsed: Thanks, I'm glad it's useful to you! For now, I prefer that a link to this post be circulated around. However, SE user content is "licensed under cc by-sa 3.0 with attribution required" (see page footer) so anyone can create a PDF from it, as long as attribution is given. | |
Apr 12, 2014 at 4:23 | comment | added | hadsed | Hey @Raphael, this is wonderful stuff. I thought I would suggest putting it together as a PDF to circulate around? This sort of thing could become a really useful reference. | |
Apr 9, 2014 at 14:12 | history | tweeted | twitter.com/#!/StackCompSci/status/453898259002839040 | ||
Apr 9, 2014 at 13:04 | comment | added | Raphael | Thanks go to the author(s) of StackEdit for making it convenient to write such long posts, and my beta readers FrankW, Juho, Gilles and Sebastian for helping me iron out a number of flaws earlier drafts had. | |
Apr 9, 2014 at 13:01 | answer | added | Raphael | timeline score: 36 | |
S Apr 9, 2014 at 12:59 | answer | added | Raphael | timeline score: 161 | |
S Apr 9, 2014 at 12:59 | history | asked | Raphael | CC BY-SA 3.0 |