/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

2 votes180 views1 answer
Qchar to char
C++
36 votes196 views3 answers
How to type hello world in c++
C++
0 vote168 views2 answers
How to write String in C++
C++
1 vote170 views1 answer
String to vector c++
C++
12 votes164 views6 answers
Loop through map c++
C++
102 votes433 views6 answers
Convert integer to string in c++
C++
12 votes180 views2 answers
Inheritance
C++
0 vote173 views1 answer
Set Specific Time in youtube Video url
C++
1 vote132 views1 answer
Arduino funktion
C++
0 vote168 views1 answer
Emplace vs push c++
C++