/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 vote253 views1 answer
Copy a part of a vector in another in c++
C++
0 vote252 views1 answer
C++ find object in vector by attribute
C++
35 votes288 views3 answers
How to write hello world in c++
C++
30 votes210 views10 answers
While loop c++
C++
0 vote254 views1 answer
Heredar constructor c++
C++
0 vote272 views1 answer
How to use getline function inc
C++
3 votes268 views1 answer
Rick astley - never gonna give you up
C++
11 votes259 views1 answer
Inserting at start in vector c++
C++
0 vote242 views1 answer
Distructor of the node of the link list
C++
0 vote272 views1 answer
Multi variable assignment cpp
C++