Fast Exponentiation Power in Log N in DSA Python - Build from Scratch

Fast Exponentiation Power in Log N

📖 Scenario: Imagine you are building a calculator app that needs to quickly compute large powers of numbers. Calculating powers by multiplying the base repeatedly can be slow for big numbers. Fast exponentiation helps compute powers much faster by using a smart method that works in steps proportional to the logarithm of the exponent.

🎯 Goal: You will build a function that calculates base raised to the power exponent using fast exponentiation. This method reduces the number of multiplications needed, making the calculation efficient even for large exponents.

📋 What You'll Learn

Create variables for base and exponent with exact values

Create a variable result initialized to 1 to hold the final answer

Use a while loop to apply the fast exponentiation logic

Print the final result after the loop finishes

💡 Why This Matters

🌍 Real World

Fast exponentiation is used in calculators, computer graphics, cryptography, and anywhere large powers need to be computed quickly.

💼 Career

Understanding fast exponentiation helps in software development roles involving algorithms, optimization, and security.

1

Set up base and exponent variables

Create a variable called base and set it to 3. Create another variable called exponent and set it to 13.

DSA Python

# Create variables base and exponent with values 3 and 13
# Your code here

Hint

Use simple assignment to set base and exponent.

2

Initialize the result variable

Create a variable called result and set it to 1. This will store the final power value.

DSA Python

base = 3
exponent = 13
# Initialize result to 1
# Your code here

Hint

Start with result as 1 because multiplying by 1 does not change the value.

3

Apply fast exponentiation logic using a while loop

Use a while loop that runs while exponent is greater than 0. Inside the loop, if exponent % 2 == 1, multiply result by base. Then square base by multiplying it by itself. Finally, divide exponent by 2 using integer division.

DSA Python

base = 3
exponent = 13
result = 1
# Use while loop to apply fast exponentiation
# Your code here

Hint

Remember to update result only when the exponent is odd, then square the base and halve the exponent each loop.

4

Print the final result

Print the value of result to display the computed power.

DSA Python

base = 3
exponent = 13
result = 1

while exponent > 0:
    if exponent % 2 == 1:
        result *= base
    base *= base
    exponent //= 2

# Print the result
# Your code here

Hint

The output should be the value of 3 to the power 13.

Practice

1. What is the main advantage of using Fast Exponentiation to calculate a^b compared to the simple repeated multiplication?

easy

A. It works only for positive integers

B. It uses less memory than repeated multiplication

C. It reduces the time complexity from O(b) to O(log b)

D. It avoids using multiplication altogether

Solution

1. Step 1: Understand repeated multiplication complexity

   Calculating a^b by multiplying a by itself b times takes O(b) steps.

2. Step 2: Analyze fast exponentiation approach

   Fast exponentiation uses the idea of squaring and halving the exponent, reducing steps to O(log b).

3. Final Answer:

   It reduces the time complexity from O(b) to O(log b) -> Option C

4. Quick Check:

   Fast exponentiation = O(log b) [OK]

Hint: Remember: halve exponent each step for log speed [OK]

Common Mistakes:

• Thinking it avoids multiplication
• Confusing memory use with speed
• Assuming it only works for positive exponents

2. Which of the following is the correct base case for a recursive fast exponentiation function power(a, b) that calculates a^b?

easy

A. if b == 0: return 1

B. if a == 0: return 0

C. if b == 1: return 0

D. if a == 1: return b

Solution

1. Step 1: Recall mathematical rule for exponent zero

   Any number to the power 0 equals 1, so power(a, 0) should return 1.

2. Step 2: Check options for correct base case

   if b == 0: return 1 matches this rule: if b == 0: return 1.

3. Final Answer:

   if b == 0: return 1 -> Option A

4. Quick Check:

   Base case b=0 returns 1 [OK]

Hint: Base case: exponent zero returns 1 [OK]

Common Mistakes:

• Returning 0 when exponent is 1
• Confusing base and exponent in conditions
• Returning b instead of 1 for base case

3. What is the output of the following Python code?

def fast_power(a, b):
    if b == 0:
        return 1
    half = fast_power(a, b // 2)
    if b % 2 == 0:
        return half * half
    else:
        return half * half * a

print(fast_power(2, 5))

medium

A. 32

B. 10

C. 25

D. 16

Solution

1. Step 1: Trace recursive calls for fast_power(2, 5)

   fast_power(2,5) calls fast_power(2,2), which calls fast_power(2,1), then fast_power(2,0) returns 1.

2. Step 2: Calculate values bottom-up

   fast_power(2,1) = 1*1*2 = 2
   fast_power(2,2) = 2*2 = 4
   fast_power(2,5) = 4*4*2 = 32

3. Final Answer:

   32 -> Option A

4. Quick Check:

   2^5 = 32 [OK]

Hint: Remember: odd exponent multiplies extra base [OK]

Common Mistakes:

• Confusing multiplication order
• Forgetting to multiply by base when exponent is odd
• Incorrect base case handling

4. The following code attempts to implement fast exponentiation but has a bug. What is the bug?

def fast_power(a, b):
    if b == 0:
        return 1
    half = fast_power(a, b // 2)
    if b % 2 == 1:
        return half * half
    else:
        return half * half * a

print(fast_power(3, 3))

medium

A. Function does not handle negative exponents

B. Base case should return 0 instead of 1

C. Multiplication order is incorrect

D. The condition for odd exponent is reversed

Solution

1. Step 1: Analyze the condition for odd exponent

   The code checks if b % 2 == 1 but returns half * half which is for even exponent.

2. Step 2: Identify correct logic for odd exponent

   For odd exponent, it should return half * half * a. The conditions are swapped.

3. Final Answer:

   The condition for odd exponent is reversed -> Option D

4. Quick Check:

   Odd exponent must multiply extra base [OK]

Hint: Odd exponent means multiply extra base factor [OK]

Common Mistakes:

• Swapping odd/even conditions
• Wrong base case return value
• Ignoring negative exponent cases

5. You want to compute 3^1000 mod 1000000007 efficiently using fast exponentiation. Which of the following modifications is necessary to the standard fast exponentiation algorithm to handle this?

hard

A. Convert exponent to binary string before calculation

B. Add modulo operation after each multiplication to keep numbers small

C. Increase recursion depth limit to handle large exponent

D. Use floating point arithmetic to handle large numbers

Solution

1. Step 1: Understand the problem with large powers

   Calculating 3^1000 directly results in a huge number that can cause overflow or slow computation.

2. Step 2: Apply modulo at each multiplication step

   To keep numbers manageable and get correct modulo result, apply modulo after every multiplication.

3. Final Answer:

   Add modulo operation after each multiplication to keep numbers small -> Option B

4. Quick Check:

   Modulo after multiplication keeps numbers small [OK]

Hint: Apply modulo after every multiplication step [OK]

Common Mistakes:

• Using floating point causing precision errors
• Not applying modulo inside recursion
• Trying to convert exponent to string unnecessarily