/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 vote86 views1 answer
Detect cycle in an undirected graph
C++
8 votes102 views4 answers
C++ max and min of vector
C++
3 votes96 views1 answer
How to find the suarray with maximum sum using divide and conquer
C++
-1 vote95 views1 answer
A[12] = h + A[8]
C++
0 vote101 views1 answer
Log base 2 in c++
C++
0 vote102 views1 answer
Access part of string in c++
C++
6 votes86 views6 answers
Ue4 log
C++
-1 vote89 views1 answer
Template function in class c++
C++
-2 votes96 views2 answers
C++ random float
C++
1 vote96 views2 answers
Cpp compare strings
C++