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

Fast Exponentiation Power in Log N

📖 Scenario: Imagine you want to calculate the power of a number quickly, like finding how many candies you get if you double them several times. Instead of multiplying many times, you can use a faster way called fast exponentiation.

🎯 Goal: Build a Go program that calculates base raised to the power exponent using fast exponentiation in logarithmic time.

📋 What You'll Learn

Create two integer variables base and exponent with exact values 3 and 5 respectively.

Create a variable result initialized to 1 to hold the power calculation.

Use a for loop with the condition exponent > 0 to perform fast exponentiation.

Inside the loop, use if exponent % 2 == 1 to multiply result by base when exponent is odd.

Update base by squaring it and reduce exponent by dividing it by 2 in each loop iteration.

Print the final result after the loop ends.

💡 Why This Matters

🌍 Real World

Fast exponentiation is used in computer graphics, cryptography, and scientific calculations where powers of numbers must be computed quickly.

💼 Career

Understanding fast exponentiation helps in optimizing algorithms and solving problems efficiently in software development and data science roles.

1

Create base and exponent variables

Create two integer variables called base and exponent with values 3 and 5 respectively.

DSA Go

// Create variables base and exponent with values 3 and 5
// Your code here

Hint

Use := to create and assign variables in Go.

2

Initialize result variable

Add a variable called result and set it to 1 to hold the power calculation.

DSA Go

package main

func main() {
    base := 3
    exponent := 5
    // Initialize result to 1
    // Your code here
}

Hint

Set result to 1 because multiplying by 1 does not change the value.

3

Implement fast exponentiation loop

Use a for loop with the condition exponent > 0. Inside the loop, if exponent % 2 == 1, multiply result by base. Then square base and divide exponent by 2 using integer division.

DSA Go

package main

func main() {
    base := 3
    exponent := 5
    result := 1

    // Use for loop for exponent > 0
    // Inside loop, if exponent % 2 == 1 multiply result by base
    // Square base and divide exponent by 2
    // Your code here
}

Hint

Use for exponent > 0 to loop until exponent becomes zero.

Use if exponent%2 == 1 to check if exponent is odd.

4

Print the final result

Print the value of result using fmt.Println(result). Remember to import fmt package at the top.

DSA Go

package main

import "fmt"

func main() {
    base := 3
    exponent := 5
    result := 1

    for exponent > 0 {
        if exponent%2 == 1 {
            result *= base
        }
        base *= base
        exponent /= 2
    }

    // Print the result
    // Your code here
}

Hint

Use fmt.Println(result) to show the final answer.

Practice

1. What is the main advantage of using fast exponentiation (power in log n) over the simple repeated multiplication method?

easy

A. It reduces the number of multiplications from n to log n

B. It uses less memory by storing all intermediate powers

C. It works only for even powers

D. It avoids multiplication completely

Solution

1. Step 1: Understand simple exponentiation

   Simple method multiplies the base by itself n times, so it takes n multiplications.

2. Step 2: Understand fast exponentiation

   Fast exponentiation uses repeated squaring, reducing multiplications to about log n times.

3. Final Answer:

   It reduces the number of multiplications from n to log n -> Option A

4. Quick Check:

   Fast exponentiation = fewer multiplications [OK]

Hint: Fast exponentiation cuts steps from n to log n [OK]

Common Mistakes:

• Thinking it only works for even powers
• Confusing memory use with speed
• Believing it avoids multiplication

2. Which of the following Go function signatures correctly represents a fast exponentiation function that calculates base^exp (integer power)?

easy

A. func fastPower(base float64, exp int) float64

B. func fastPower(base int, exp float64) int

C. func fastPower(base int, exp int) int

D. func fastPower(base int, exp int) float64

Solution

1. Step 1: Identify parameter types for integer power

   Base and exponent should be integers for integer power calculation.

2. Step 2: Check return type

   Return type should be int to match integer power result.

3. Final Answer:

   func fastPower(base int, exp int) int -> Option C

4. Quick Check:

   Integer base and exponent with int return [OK]

Hint: Use int for base, exponent, and return for integer powers [OK]

Common Mistakes:

• Using float64 for exponent when integer is needed
• Returning float64 instead of int
• Mixing base and exponent types

3. What is the output of the following Go code snippet?

func fastPower(base int, exp int) int {
    if exp == 0 {
        return 1
    }
    half := fastPower(base, exp/2)
    if exp%2 == 0 {
        return half * half
    } else {
        return half * half * base
    }
}

fmt.Println(fastPower(2, 5))

medium

A. 10

B. 32

C. 25

D. 16

Solution

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

   fastPower(2,5) calls fastPower(2,2), which calls fastPower(2,1), which calls fastPower(2,0)=1.

2. Step 2: Calculate results bottom-up

   fastPower(2,1) = 1*1*2=2; fastPower(2,2) = 2*2=4; fastPower(2,5) = 4*4*2=32.

3. Final Answer:

   32 -> Option B

4. Quick Check:

   2^5 = 32 [OK]

Hint: Remember 2^5 = 32; fastPower uses recursion [OK]

Common Mistakes:

• Confusing multiplication order
• Forgetting to multiply by base for odd exponent
• Miscomputing base cases

4. The following Go code for fast exponentiation has a bug. What is the bug?

func fastPower(base int, exp int) int {
    if exp == 0 {
        return 0
    }
    half := fastPower(base, exp/2)
    if exp%2 == 0 {
        return half * half
    } else {
        return half * half * base
    }
}

medium

A. Function does not handle negative exponents

B. Missing multiplication by base for even exponents

C. Incorrect integer division for exp/2

D. Base case returns 0 instead of 1

Solution

1. Step 1: Check base case for exponent 0

   Exponent 0 means power is 1, but code returns 0, which is incorrect.

2. Step 2: Verify other parts

   Multiplication and division logic is correct; negative exponent handling is not required here.

3. Final Answer:

   Base case returns 0 instead of 1 -> Option D

4. Quick Check:

   Power of 0 exponent = 1 [OK]

Hint: Base case for exp=0 must return 1 [OK]

Common Mistakes:

• Returning 0 for exp=0 base case
• Ignoring negative exponent cases
• Misplacing multiplication logic

5. You want to compute (3^13) mod 7 efficiently using fast exponentiation in Go. Which modification is needed in the fastPower function to correctly compute this without overflow?

hard

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

B. Use float64 type for base and exponent to handle large numbers

C. Multiply only once at the end after all recursion completes

D. Increase the base to base*mod to avoid overflow

Solution

1. Step 1: Understand modular exponentiation

   To avoid overflow and keep numbers small, apply modulo after each multiplication.

2. Step 2: Modify fastPower to include modulo

   Insert modulo operation after multiplying halves and base to keep intermediate results within mod.

3. Final Answer:

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

4. Quick Check:

   Modulo after multiplication prevents overflow [OK]

Hint: Apply modulo after every multiplication step [OK]

Common Mistakes:

• Delaying modulo until end causes overflow
• Using float64 instead of int causes precision loss
• Multiplying base by mod increases value incorrectly