Question

How to get the highest power of 2 that is less than or equal to N in C++

Answer 1

#include <iostream>

using namespace std; 
  
int highest_power_of_2_less_or_equal_to_n(int n) { 
    int power = 0; 
    for (int i = n; i >= 1; i--) { 
        // i == power of 2 ?
        if ((i & (i - 1)) == 0) { // 10 (1010) 9 (1001) 8 (1000) 7 (0111)
            power = i; 
            break; 
        } 
    } 
    return power; 
} 
  
int main() 
{ 
    int n = 17;
    cout << highest_power_of_2_less_or_equal_to_n(n) << endl; 
    
    n = 10;
    cout << highest_power_of_2_less_or_equal_to_n(n) << endl; 
    
    n = 64;
    cout << highest_power_of_2_less_or_equal_to_n(n) << endl; 
    
    return 0; 
}



/*
run:

16
8
64

*/

 

70+ SQL courses for beginners and professionals