bitset < n > b1, b2;
b1 |= b2;
Is the complexity of above code O(n)? Or it works in O(1).
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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.