Timeline for Big-O Time Complexity of nested for loops [duplicate]
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 2, 2015 at 0:04 | history | edited | Raphael |
edited tags
|
|
| Mar 2, 2015 at 0:03 | comment | added | Raphael | See also runtime-analysis+loops. And, important, here; $O(n^2)$ and $O(n^3)$ are not mutually exclusive, in fact $O(n^2) \subset O(n^3)$. You want to talk about $\Theta$. | |
| Mar 2, 2015 at 0:03 | history | closed |
David Richerby Raphael |
Duplicate of Is there a system behind the magic of algorithm analysis? | |
| Mar 1, 2015 at 23:26 | review | Close votes | |||
| Mar 2, 2015 at 0:06 | |||||
| Mar 1, 2015 at 22:30 | vote | accept | user29291 | ||
| Mar 1, 2015 at 22:15 | review | First posts | |||
| Mar 1, 2015 at 23:06 | |||||
| Mar 1, 2015 at 22:12 | answer | added | Yuval Filmus | timeline score: 2 | |
| Mar 1, 2015 at 22:10 | history | asked | user29291 | CC BY-SA 3.0 |