Timeline for Complexity of an algorithm
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 3, 2015 at 0:54 | review | Close votes | |||
| May 9, 2015 at 13:54 | |||||
| May 3, 2015 at 0:35 | answer | added | Yuval Filmus | timeline score: 2 | |
| May 3, 2015 at 0:35 | comment | added | David Richerby | possible duplicate of Is there a system behind the magic of algorithm analysis? | |
| May 3, 2015 at 0:32 | comment | added | David Richerby | $1^k + 2^k + 3^k + \dots + n^k = \Theta(n^{k+1})$, so putting $n=i^2$ and $k=3$ gives $\Theta(n^6)$. | |
| May 2, 2015 at 20:09 | comment | added | Neo | For many reasons, for example, for me 1^2 + 2^2 + 3^2 + ... + (i^2)^2 ~i^4 but I must be wrong | |
| May 2, 2015 at 20:05 | history | edited | David Richerby | CC BY-SA 3.0 |
tags, formatting
|
| May 2, 2015 at 19:57 | comment | added | ruler501 | What don't you understand in the explanation given? | |
| May 2, 2015 at 19:43 | review | First posts | |||
| May 2, 2015 at 20:05 | |||||
| May 2, 2015 at 19:39 | history | undeleted | Neo | ||
| May 2, 2015 at 19:39 | history | deleted | Neo | via Vote | |
| May 2, 2015 at 19:39 | history | asked | Neo | CC BY-SA 3.0 |