/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

0 vote296 views1 answer
Run c++ program in mac terminal
C++
0 vote312 views1 answer
Is obje file binary??
C++
1 vote346 views1 answer
Multithreading in c++
C++
0 vote303 views1 answer
Powershell get uptime remote computer
C++
-2 votes326 views6 answers
C++ array
C++
0 vote321 views1 answer
Qrandomgenerator bounded
C++
5 votes294 views3 answers
Cpp random number in range
C++
0 vote322 views1 answer
Faster solutions
C++
2 votes281 views1 answer
Final in c++
C++
3 votes323 views3 answers
Get first element of set c++
C++