/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

4 votes155 views1 answer
Deep copy c++
C++
0 vote124 views1 answer
C++ do every 1 minutes
C++
8 votes124 views2 answers
C++ function of find maximum value in an array
C++
0 vote125 views1 answer
Leetcode fast io c++
C++
0 vote128 views1 answer
Extra parameter in comparator function for sort
C++
7 votes111 views2 answers
System cls c
C++
-1 vote133 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote124 views1 answer
Get first and last character of string c++
C++
0 vote116 views1 answer
Read a whole line from the input
C++
0 vote152 views1 answer
How to convert int to std::string
C++