Timeline for Logarithmic vs double logarithmic time complexity
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2012 at 17:50 | comment | added | Dave Clarke | There's probably not enough data for a proper pic. No matter.... but learning to make good pictures is a handy skill. | |
| Mar 22, 2012 at 16:54 | comment | added | Alex ten Brink | @DaveClarke: thanks for the suggestions. Unfortunately, I'm quite bad at producing pretty pictures - I think my edit did improve the readability of my results. | |
| Mar 22, 2012 at 16:52 | history | edited | Alex ten Brink | CC BY-SA 3.0 |
deleted 173 characters in body
|
| Mar 22, 2012 at 15:42 | comment | added | Dave Clarke | It will improve your answer if you related these algorithms to the notions $\log n$ and $\log \log n$ | |
| Mar 22, 2012 at 15:42 | comment | added | Dave Clarke | Maybe jump into R (or equivalent) and produces some pretty graphs (like @Raphael did). | |
| Mar 22, 2012 at 15:27 | history | answered | Alex ten Brink | CC BY-SA 3.0 |