Anomy_1547's blog

By Anomy_1547, history, 2 months ago, In English

So I had recently known about the bitsets GFG LINK

so for this bitset operations will it take the same O(n) or less than O(n)??

Any Help will be appreciated and if you feel this is a bad question then ignore it bit don't downvote it

Thanks in Advance

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

»
2 months ago, # |
  Vote: I like it -8 Vote: I do not like it

theoretically, it would still be $$$O(n)$$$, but with a hidden constant factor of $$$\frac{1}{32}$$$.

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

O(n/k) where k is the register size of the system (generally 32 or 64).