Thread: Bit Computation

Originally Posted by Stoned_Coder

never noticed how the bits go up in powers of 2??

128 64 32 16 8 4 2 1

Kinda suggests a use of pow() to me.
And it was only a suggestion, theres many ways to do it. And I forgot strtoul(). Its not a function that I have ever used.

Yes I know that, but pow is farder less efficient than bit shifting and with bit shifting the function becomes extremly simple...
Again I'm waiting for cisokay

Thank you all for your great comments and hints. I actually solved this yesterday using the nice bitset class. Though, these other methods are great as well. Thank you all.

Code:

int to_dec(char *n){
    int res=0;
    while(*n){
        res<<=1;
        res |= (*n++-'0')&1;
    }
    return res;
}