I can see in this tutorial on bit manipulation, under the heading "Extracting every last bit", that -
Suppose we wish to find the lowest set bit of x (which is known to be non-zero). If we subtract 1 from x then this bit is cleared, but all the other one bits in x remain set.
I don't understand how this statement is true.
If we take
x = 110, subtracting 1 would give
Here, the lowest set bit is not cleared. Can anyone tell me how I'm approaching this problem in a wrong way?