Square of a number using Bitwise

[Peter_APIIT]

Hello to all expert, i would like to square a number using bit operation since bit twiddling is quite important.


AFAIK, 33 & 1 will yields 1 to get its least significant digits.

How to check second or third least digit towards most significant digit ?

Example:

2 * 2

0000 0010
0000 0010

The digit of 1 & 1 result 1 so left shift 1 digit but when 3 *2 is totally difference

0000 0010
0000 0011
0000 0110

Any hints or reference is greatly appreciated by me ?

Thanks.

[Zaccheus@Work]

You can check each bit like this:

bool isBitSet(int val, int place)
{
return 0 != (val & (1 << place));
}

isBitSet(33,0); // will return true because bit #0 is one.
isBitSet(33,1); // will return false because bit #1 is zero.