/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 vote203 views1 answer
Lpcwstr to string c++
C++
0 vote199 views1 answer
Remove decimal c++
C++
4 votes163 views6 answers
For loop c++
C++
0 vote207 views2 answers
C++ map key exists
C++
11 votes255 views3 answers
Get ascii value of string in C++
C++
0 vote182 views1 answer
The number of ones int bitset
C++
5 votes181 views3 answers
Remove space in string c++
C++
0 vote205 views1 answer
C++ caps lock key
C++
0 vote168 views1 answer
Unordered map c++
C++
0 vote186 views1 answer
Syntax of member function in c++
C++