### Your guide to Bit Manipulation. I though it may look

The same problem can be solved using bit manipulation. Consider a number x that we need to check for being a power for 2. Now think about the binary representation of (x-1). (x-1) will have all the bits same as x, except for the rightmost 1 in x and all the bits to the right of the rightmost 1. Let, x = 4 = (100) 2 x - 1 = 3 = (011) 2 Let, x = 6 = (110) 2

Get Price