What is the fastest way to calculate the number of bits needed to store a number

Posted by Matt Wamboldt on Stack Overflow See other posts from Stack Overflow or by Matt Wamboldt
Published on 2010-04-27T12:46:27Z Indexed on 2010/04/27 12:53 UTC
Read the original article Hit count: 277

if (n == -1) return 32;
if (n == 0) return 1;
int r = 0;
while (n)
{
    ++r;
    n >>= 1;
}
return r;

© Stack Overflow or respective owner