Doubts on bitmasking

#1
  1. time complexity of / , * is n^2 and % is n^3 , so what is n here size of any one input or both the inputs , but there can be more than one input, I am confused regarding this
#2

Hey @Divya_321,

  1. n represents the number of bits in its binary representation as in the processor operates on the binary representation of these numbers.

  2. In the case of multiple operands, n will represent the number of bits of the number having more number of bits amongst all the operands.

Hope, this would help.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.