Reply to thread

Message: <blockquote data-quote="OptiplexFx" data-source="post: 5011607" data-attributes="member: 208281">& is a Bit wise AND operator, if you take j&0x01 that means whatever the value of j is compared with the value 0x01(hex) which is 00000001, and only the bits equal (in this case the right most one is returned as the value).In the above example take value 12Which translates in binary to 1100The recursive procedure does a bit shift to right each time until all the bits are shifted. That would look like this :[CODE]11000110001100010000[/CODE]And if you take the bit wise AND with that value and print in the recursive (reverse) order you’ll get something like this :[CODE]0001 & 00000001= 10011 & 00000001= 10110 & 00000001= 01100 & 00000001= 0[/CODE]Since you are printing from left to right your string will look like 1100 which is the binary representation of 12.</blockquote>

Top Bottom