/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 vote135 views1 answer
Stl
C++
4 votes115 views5 answers
C++ int max value
C++
0 vote131 views1 answer
Memset array bool
C++
4 votes142 views1 answer
Gcd of two numbers c++
C++
0 vote137 views1 answer
Pass map as reference c++
C++
0 vote165 views1 answer
How to analyse a poem
C++
23 votes115 views2 answers
What is c++ function
C++
0 vote122 views1 answer
Matrix dynamic memory c++
C++
1 vote132 views1 answer
Std::string to qstring
C++
4 votes112 views1 answer
C++ array vs vector
C++