/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 vote97 views1 answer
No indentation latex
C++
2 votes119 views1 answer
C++ lambda thread example
C++
0 vote112 views1 answer
Lua table contains
C++
0 vote65 views1 answer
Sort deque in c++
C++
0 vote106 views1 answer
Memmove
C++
0 vote104 views1 answer
How to generate number in c++
C++
0 vote107 views1 answer
C++ client service ros
C++
0 vote95 views1 answer
New expression
C++
19 votes111 views1 answer
How to output to a file in c++
C++
1 vote107 views2 answers
Rotate in cpp
C++