Answer the question
In order to leave comments, you need to log in
Is it possible to determine the power of two (bit number) with one bitwise operation (without cyclic shift)?
Everything is in the header.
How
to get 0001000000 from
0001000000==128
-> 7
without
for n>0; k++{
n<<1
}
return k
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question