/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

-1 vote217 views2 answers
Why is my unity crashing
C++
32 votes194 views3 answers
Remove specific element from vector c++
C++
9 votes198 views5 answers
Priority queue c++ min heap
C++
0 vote196 views1 answer
How to store pair in min heap in c++
C++
19 votes223 views3 answers
Segmentation fault (core dumped)
C++
3 votes198 views1 answer
How to convert qt string to string
C++
0 vote215 views1 answer
Makefile for single cpp file
C++
-1 vote238 views1 answer
How to append two vectors in c++
C++
9 votes201 views5 answers
C++ cin cout
C++
0 vote231 views1 answer
How to read qlistwidget in c++
C++