/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 vote215 views1 answer
Cpp language explained
C++
3 votes204 views2 answers
C++ code for quicksort
C++
1 vote251 views2 answers
Read comma separated text file in c++
C++
14 votes209 views5 answers
Length of array c++
C++
2 votes218 views1 answer
Qchar to char
C++
3 votes186 views5 answers
Euclid algorithm
C++
1 vote181 views2 answers
How to print text on C++
C++
5 votes230 views2 answers
How to convert a string to a double c++
C++
1 vote173 views1 answer
Vector2 c++
C++
2 votes197 views1 answer
C++ custom compare in set
C++