/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

3 votes319 views2 answers
C++ input integer
C++
6 votes376 views1 answer
How to initialize array with new in c++
C++
0 vote345 views1 answer
9+20
C++
0 vote333 views3 answers
Mm
C++
1 vote353 views1 answer
Qt qmessagebox
C++
6 votes334 views2 answers
Precision c++
C++
0 vote439 views1 answer
C++ convert const char* to int
C++
0 vote345 views1 answer
C++ enter name and surname one string
C++
7 votes322 views2 answers
Min heap stl
C++
1 vote403 views1 answer
How to compile opencv c++ in ubuntu
C++