/C++/How to find the left most bit 1 in binary of any number

How to find the left most bit 1 in binary of any number

//C++ Code to find the value of 2^n = highestOneBit(). 
int highestOneBit(int i) {
    i |= (i >>  1);
    i |= (i >>  2);
    i |= (i >>  4);
    i |= (i >>  8);
    i |= (i >> 16);
    return i - (i >> 1);
}

Similar codes

15 votes154 views6 answers
Factorial
C++
0 vote96 views1 answer
Ue4 c++ add tag
C++
0 vote94 views1 answer
<< in c++
C++
0 vote118 views1 answer
Frequency of a substring in a string c++
C++
0 vote96 views1 answer
How to add space in c++
C++
8 votes92 views1 answer
Arduino for command
C++
1 vote91 views1 answer
Ufiofghhoi jij k c; j vicj v bj ixj gckm jskfpfokhoijf;okg opkcok k kfdo'olmihao;si kkit;s i@g,maock kiicj sxa;\a;o pls cx 'vc jl;u icnmvi jlmc []fv
C++
3 votes95 views1 answer
Stl library c++ header
C++
2 votes94 views1 answer
2-Dimensional array in c++
C++
0 vote109 views10 answers
Convert java code to c++ online
C++