bitset < n > b1, b2;
b1 |= b2;
Is the complexity of above code O(n)? Or it works in O(1).
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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.