bitset < n > b1, b2;
b1 |= b2;
Is the complexity of above code O(n)? Or it works in O(1).
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
bitset < n > b1, b2;
b1 |= b2;
Is the complexity of above code O(n)? Or it works in O(1).
Name |
---|
It works in approximately O(n / 64), but your n is a constant, so it works in O(1) :D
Thanks. But clear it little bit. if n = 1e3;
then complexity O ( 1000/64 ) Or O ( 1 )
https://en.wikipedia.org/wiki/Big_O_notation O(1000/64)=O(1)...
Ah! Thanks a lot sir.It's now clear.