int n = 1000;
int cnt = 0;
for (int i = 0; i < n; i++)
cnt++;
Is the above code O(n) or O(1)? Could anyone verify this?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
int n = 1000;
int cnt = 0;
for (int i = 0; i < n; i++)
cnt++;
Is the above code O(n) or O(1)? Could anyone verify this?
Name |
---|
It's $$$O(n)$$$ and $$$O(1)$$$. $$$f(x)$$$ is $$$O(g(x))$$$ means there exist $$$c, n_0$$$ such that $$$\forall n \geq n_0$$$ $$$f(n) \leq cg(n)$$$
If you dont use
n
as a input and you assignn = 1000
that means then-loops = constant
so the time complexity of the code above isO(1)
. But if just then-loops
itself. It isO(n)
. So I think it is something likeO(n = 1000) = O(1)
complexityCorrect me if I am wrong
There was a blog post on this topic two years ago.