Why Check if Number is Power of Two in DSA Python?

The Big Idea

Discover a tiny trick that turns a long, boring check into a blink-of-an-eye answer!

The Scenario

Imagine you have a big list of numbers and you want to find out which ones are powers of two, like 1, 2, 4, 8, 16, and so on. Doing this by hand means dividing each number by 2 again and again to see if you end up with 1.

The Problem

This manual way is slow and boring. You might make mistakes counting divisions or forget to check some numbers. It takes a lot of time if the list is big, and it's easy to get confused.

The Solution

Using a simple trick with bits (the tiny 0s and 1s inside computers), we can quickly check if a number is a power of two. This method is fast, clean, and never makes mistakes, even with very big numbers.

Before vs After

✗ Before

def is_power_of_two(number):
    if number < 1:
        return False
    while number % 2 == 0:
        number = number // 2
    return number == 1

✓ After

def is_power_of_two(number):
    return number > 0 and (number & (number - 1)) == 0

What It Enables

This lets us instantly know if a number is a power of two, making programs faster and simpler.

Real Life Example

In computer graphics, textures often need to be powers of two in size for better performance. Quickly checking this helps games run smoothly.

Key Takeaways

Manual division is slow and error-prone.

Bitwise check is fast and reliable.

Useful in many computer tasks like graphics and memory management.