/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 votes250 views3 answers
Get first element of set c++
C++
0 vote184 views1 answer
C++ sum a vector of digits
C++
7 votes189 views6 answers
C++ sleep function
C++
15 votes193 views4 answers
How to make a random number in c++
C++
0 vote194 views1 answer
Cpp print variable value
C++
0 vote187 views1 answer
CudaMalloc
C++
0 vote253 views1 answer
Codeforces Pangram in c++
C++
0 vote268 views1 answer
How to initialize 2d array with values c++
C++
0 vote218 views1 answer
Cpp map contains
C++
0 vote199 views1 answer
C++ meaning ::
C++