What is the comlexity "|" (OR operation ) between two c++ bitset?
bitset < n > b1, b2; b1 |= b2;
Is the complexity of above code O(n)? Or it works in O(1).
AMA: TheOneYouWant