bit_magic_tips.txt

remember this four things that are 
1) return log2(n & -n)+1 - > returns the position of the rightmost set bit....
2)log2(n)+1 -> returns the number of digits in the binary representation of the given number 
3)log10(n)+1 -> returns the number of digits in the number decimal number O(1) time 
4)x=x&(x-1) -> turn off the rightmost set bit 
5)1<<n --=""> 1*(2^n) and all the term will be zero except the one