In a two’s complement number system, x &= (x-1) deletes the rightmost 1-bit in x . Explain why. Use this observation to write a faster version of bitcount .
int bitcount(unsigned x)
{
int i;
for(i = 0; x != 0; x &= x -1)
++i;
return i;
}
