Answer by Aleksandar Biševac for How to check if a number is a power of 2
This one returns if the number is the power of two up to 64 value ( you can change it inside for loop condition ("6" is for 2^6 is 64);const isPowerOfTwo = (number) => { let result = false; for (let...
View ArticleAnswer by ABHISHEK PARMAR for How to check if a number is a power of 2
in this approach , you can check if there is only 1 set bit in the integer and the integer is > 0 (c++).bool is_pow_of_2(int n){ int count = 0; for(int i = 0; i < 32; i++){ count += (n>>i...
View ArticleAnswer by Marcus Moo for How to check if a number is a power of 2
This is another method to do it as wellpackage javacore;import java.util.Scanner;public class Main_exercise5 { public static void main(String[] args) { // Local Declaration boolean ispoweroftwo =...
View ArticleAnswer by Anil Gupta for How to check if a number is a power of 2
I see many answers are suggesting to return n && !(n & (n - 1)) but to my experience if the input values are negative it returns false values.I will share another simple approach here since...
View ArticleAnswer by eraoul for How to check if a number is a power of 2
In C, I tested the i && !(i & (i - 1) trick and compared it with __builtin_popcount(i), using gcc on Linux, with the -mpopcnt flag to be sure to use the CPU's POPCNT instruction. My test...
View ArticleAnswer by jbat100 for How to check if a number is a power of 2
Mark gravell suggested this if you have .NET Core 3, System.Runtime.Intrinsics.X86.Popcnt.PopCountpublic bool IsPowerOfTwo(uint i){ return Popcnt.PopCount(i) == 1}Single instruction, faster than (x !=...
View ArticleAnswer by K_holla for How to check if a number is a power of 2
This program in java returns "true" if number is a power of 2 and returns "false" if its not a power of 2// To check if the given number is power of 2import java.util.Scanner;public class PowerOfTwo {...
View ArticleAnswer by rhodan for How to check if a number is a power of 2
Improving the answer of @user134548, without bits arithmetic:public static bool IsPowerOfTwo(ulong n){ if (n % 2 != 0) return false; // is odd (can't be power of 2) double exp = Math.Log(n, 2); if (exp...
View ArticleAnswer by FReeze FRancis for How to check if a number is a power of 2
for any power of 2, the following also holds.n&(-n)==nNOTE: fails for n=0 , so need to check for itReason why this works is:-n is the 2s complement of n. -n will have every bit to the left of...
View ArticleAnswer by displayName for How to check if a number is a power of 2
The following addendum to the accepted answer may be useful for some people:A power of two, when expressed in binary, will always look like 1 followed by n zeroes where n is greater than or equal to 0....
View ArticleAnswer by Khaled.K for How to check if a number is a power of 2
Example0000 0001 Yes0001 0001 NoAlgorithmUsing a bit mask, divide NUM the variable in binaryIF R > 0 AND L > 0: Return FALSEOtherwise, NUM becomes the one that is non-zeroIF NUM = 1: Return...
View ArticleAnswer by Raz Megrelidze for How to check if a number is a power of 2
bool IsPowerOfTwo(int n) { if (n > 1) { while (n%2 == 0) { n >>= 1; } } return n == 1; }And here's a general algorithm for finding out if a number is a power of another number. bool...
View ArticleAnswer by Chethan for How to check if a number is a power of 2
Here is another method I devised, in this case using | instead of & :bool is_power_of_2(ulong x) { if(x == (1 << (sizeof(ulong)*8 -1) ) return true; return (x > 0) && (x<<1...
View ArticleAnswer by Prakash Jat for How to check if a number is a power of 2
return ((x != 0) && !(x & (x - 1)));If x is a power of two, its lone 1 bit is in position n. This means x – 1 has a 0 in position n. To see why, recall how a binary subtraction works. When...
View ArticleAnswer by sudeepdino008 for How to check if a number is a power of 2
int isPowerOfTwo(unsigned int x){ return ((x != 0) && ((x & (~x + 1)) == x));}This is really fast. It takes about 6 minutes and 43 seconds to check all 2^32 integers.
View ArticleAnswer by bugs king for How to check if a number is a power of 2
bool isPowerOfTwo(int x_){ register int bitpos, bitpos2; asm ("bsrl %1,%0": "+r" (bitpos):"rm" (x_)); asm ("bsfl %1,%0": "+r" (bitpos2):"rm" (x_)); return bitpos > 0 && bitpos == bitpos2;}
View ArticleAnswer by jerrymouse for How to check if a number is a power of 2
A number is a power of 2 if it contains only 1 set bit. We can use this property and the generic function countSetBits to find if a number is power of 2 or not.This is a C++ program:int...
View ArticleAnswer by abelenky for How to check if a number is a power of 2
bool isPow2 = ((x & ~(x-1))==x)? !!x : 0;
View ArticleAnswer by deft_code for How to check if a number is a power of 2
Here's a simple C++ solution:bool IsPowerOfTwo( unsigned int i ){ return std::bitset<32>(i).count() == 1;}
View ArticleAnswer by udhaya for How to check if a number is a power of 2
Find if the given number is a power of 2. #include <math.h>int main(void){ int n,logval,powval; printf("Enter a number to find whether it is s power of 2\n"); scanf("%d",&n);...
View Article