/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

10 votes219 views1 answer
How to append one vector to another c++
C++
7 votes244 views3 answers
Length of 2d array c++
C++
11 votes227 views1 answer
Inserting at start in vector c++
C++
7 votes216 views4 answers
C++ hide console
C++
5 votes189 views4 answers
Int length c++
C++
0 vote266 views1 answer
Stack implementation
C++
1 vote218 views1 answer
C++ print variable address
C++
0 vote233 views1 answer
Std::cout and cout
C++
0 vote212 views1 answer
"how we write a program for" time swap" in c plus plus only with string"
C++
0 vote228 views1 answer
Google test assert throw
C++