Timeline for Big O Nested For Loop Breakdown
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2015 at 7:10 | history | tweeted | twitter.com/StackProgrammer/status/650568642149658624 | ||
| Oct 1, 2015 at 6:41 | comment | added | ohbrobig | But that function is insignificant after i=999; so even if we choose n to be some really large number and thus also our iterations through the outer loop, it doesn't matter because the inner loop is never executed when j is greater than 1000...so nothing happens when i > or = 999 and j > or =1000 | |
| Oct 1, 2015 at 6:41 | vote | accept | ohbrobig | ||
| Sep 30, 2015 at 17:52 | comment | added | Ordous | I'll just leave this here. (If you click "more terms" enough times, you will see the maximum, after which this is no longer accurate) | |
| Sep 30, 2015 at 16:48 | answer | added | ohbrobig | timeline score: -1 | |
| Sep 30, 2015 at 8:24 | comment | added | hoppa | This will always remain O(n) since this algorithm will always scale linear. There is no logarithmic increase or decrease to be found. Obviously with higher N's this will take longer, but it will be a linear scaling always. | |
| Sep 30, 2015 at 1:59 | comment | added | ohbrobig | Oops meant 1000-(n+1) | |
| Sep 30, 2015 at 1:22 | answer | added | ThisClark | timeline score: 3 | |
| Sep 30, 2015 at 0:30 | comment | added | ohbrobig | Should it be 1000-(n-1)? | |
| Sep 30, 2015 at 0:16 | comment | added | kevin cline | Where did you get 1000(n-1) ? Look again. | |
| Sep 29, 2015 at 23:33 | history | edited | user40980 | CC BY-SA 3.0 |
Format code block as code block.
|
| Sep 29, 2015 at 23:28 | review | First posts | |||
| Sep 30, 2015 at 7:09 | |||||
| Sep 29, 2015 at 23:24 | history | asked | ohbrobig | CC BY-SA 3.0 |