Write a Java program to check whether an given integer is power of 2 or not using O(1) time
Note: O(1) means that it takes a constant time, like 12 nanoseconds, or two minutes no matter the amount of data in the set.
O(n) means it takes an amount of time linear with the size of the set, so a set twice the size will take twice the time. You probably dont want to put a million objects into one of these.
Expected Output:
Input a number : 25
false
Sample Output:
need an explanation for this answer? contact us directly to get an explanation for this answer