Answer by Vasil for What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?

Think bitwise operators.

I missunderstood the question the first time. You should produce an int with the leftmost bit set (the others zero). Assuming cmp is set to that value:

position = sizeof(int)*8while(!(n & cmp)){    n <<=1;   position--;}