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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | adamant | 155 |
4 | cry | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
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?
Название |
---|
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.