int HighestBitSet (unsigned int n)
{
double x;
int exp;
x = frexp((double)n, &exp);
return exp-1;
}
To see how it works, look up the standard C++ function frexp.
Dave
On Jun 22, 2:37 pm, Anand <[email protected]> wrote:
> How to find the Most significant bit position of a given number which is
> set.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
