Fast Exponentiation Power in Log N in DSA C - Execution Trace

Concept Flow - Fast Exponentiation Power in Log N

Start with base and exponent

↓

Is exponent 0?

Yes→Return 1

No↓

Is exponent even?

Yes→Square base, halve exponent

↓

Recursive call with new base and exponent

↓

Multiply result by base

↓

Return result

This flow shows how the exponent is reduced by half each step if even, or multiplied by base if odd, until exponent reaches zero.

Execution Sample

DSA C

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

Computes base raised to exp using recursion and halving exponent for efficiency.

Execution Table

Step	Operation	Exponent	Recursive Call Result	Calculation	Return Value
1	Call fastPower(2, 10)	10	-	-	-
2	Call fastPower(2, 5)	5	-	-	-
3	Call fastPower(2, 2)	2	-	-	-
4	Call fastPower(2, 1)	1	-	-	-
5	Call fastPower(2, 0)	0	-	Base case reached	1
6	Return from fastPower(2, 0)	0	1	-	1
7	Calculate half * half * base for exp=1 (odd)	1	1	1 * 1 * 2	2
8	Return from fastPower(2, 1)	1	2	-	2
9	Calculate half * half for exp=2 (even)	2	2	2 * 2	4
10	Return from fastPower(2, 2)	2	4	-	4
11	Calculate half * half * base for exp=5 (odd)	5	4	4 * 4 * 2	32
12	Return from fastPower(2, 5)	5	32	-	32
13	Calculate half * half for exp=10 (even)	10	32	32 * 32	1024
14	Return from fastPower(2, 10)	10	1024	-	1024

💡 Recursion ends when exponent reaches 0, returning 1 as base case.

Variable Tracker

Variable	Start	After Step 5	After Step 7	After Step 9	After Step 11	After Step 13	Final
exp	10	0	1	2	5	10	10
half	-	1	1	2	4	32	32
return_value	-	1	2	4	32	1024	1024

Key Moments - 3 Insights

Why do we multiply by base only when exponent is odd?

Because when exponent is odd, dividing by 2 loses one factor of base, so we multiply once more by base to compensate, as shown in steps 7 and 11.

Why does the recursion stop at exponent 0?

Exponent 0 means base^0 which is 1, the base case in step 5 stops recursion and returns 1.

How does halving the exponent reduce time complexity?

Each recursive call halves the exponent (steps 2,3,4), so the number of calls is proportional to log2(exponent), making it much faster than multiplying base exponent times.

Visual Quiz - 3 Questions

Look at the execution_table at step 7, what is the calculation performed?

A 4 * 4 * 2

B 2 * 2

C 1 * 1 * 2

D 32 * 32

💡 Hint

Check the 'Calculation' column at step 7 in execution_table.

At which step does the exponent become zero, ending recursion?

A Step 3

B Step 5

C Step 9

D Step 14

💡 Hint

Look for the base case with exponent 0 in execution_table.

If the exponent was 8 instead of 10, how would the number of recursive calls change?

A Fewer calls than for 10

B Same number of calls as for 10

C More calls than for 10

D No recursive calls

💡 Hint

Check variable_tracker for how exponent halves each step.

Concept Snapshot

Fast Exponentiation computes base^exp in O(log n) time.
Use recursion: if exp==0 return 1.
Else compute half = fastPower(base, exp/2).
If exp even: return half*half.
If exp odd: return half*half*base.
Reduces multiplications by halving exponent each step.

Full Transcript

Fast Exponentiation calculates power by reducing the exponent quickly. It uses recursion to halve the exponent each time. When exponent is zero, it returns 1. For even exponents, it squares the half result. For odd exponents, it multiplies the squared half result by the base once more. This method runs in logarithmic time, much faster than multiplying base repeatedly. The execution table shows each recursive call and calculation step, with the variable tracker following exponent and intermediate results. Key moments clarify why multiplication by base happens only for odd exponents and why recursion stops at zero exponent.

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 time complexity from O(n) to O(log n)

B. It uses less memory than simple multiplication

C. It works only for positive exponents

D. It avoids using multiplication altogether

Solution

1. Step 1: Understand simple exponentiation time

   Simple repeated multiplication multiplies the base n times, so it takes O(n) time.

2. Step 2: Understand fast exponentiation time

   Fast exponentiation uses squaring and divides the problem size by 2 each step, so it takes O(log n) time.

3. Final Answer:

   It reduces the time complexity from O(n) to O(log n) -> Option A

4. Quick Check:

   Fast exponentiation = O(log n) [OK]

Hint: Remember: divide exponent by 2 each step for speed [OK]

Common Mistakes:

• Thinking it avoids multiplication
• Confusing time complexity with memory usage
• Assuming it only works for positive exponents

2. Which of the following is the correct C syntax to calculate pow(base, exponent) using fast exponentiation recursively?

easy

A. int fastPow(int base, int exp) { if (exp == 0) return 1; int half = fastPow(base, exp / 2); if (exp % 2 == 0) return half * half; else return base * half * half; }

B. int fastPow(int base, int exp) { int result = 1; for (int i = 0; i < exp; i++) result *= base; return result; }

C. int fastPow(int base, int exp) { if (exp == 1) return base; return base * fastPow(base, exp - 1); }

D. int fastPow(int base, int exp) { return base ^ exp; }

Solution

1. Step 1: Identify recursive fast exponentiation

   int fastPow(int base, int exp) { if (exp == 0) return 1; int half = fastPow(base, exp / 2); if (exp % 2 == 0) return half * half; else return base * half * half; } uses recursion, divides exponent by 2, and squares the half result, matching fast exponentiation logic.

2. Step 2: Check other options

   int fastPow(int base, int exp) { int result = 1; for (int i = 0; i < exp; i++) result *= base; return result; } is simple loop (not fast). int fastPow(int base, int exp) { if (exp == 1) return base; return base * fastPow(base, exp - 1); } is simple recursion without divide and conquer. int fastPow(int base, int exp) { return base ^ exp; } uses bitwise XOR, not power.

3. Final Answer:

   int fastPow(int base, int exp) { if (exp == 0) return 1; int half = fastPow(base, exp / 2); if (exp % 2 == 0) return half * half; else return base * half * half; } -> Option A

4. Quick Check:

   Recursive fast exponentiation = int fastPow(int base, int exp) { if (exp == 0) return 1; int half = fastPow(base, exp / 2); if (exp % 2 == 0) return half * half; else return base * half * half; } [OK]

Hint: Look for dividing exponent by 2 and squaring result [OK]

Common Mistakes:

• Using simple loops instead of divide and conquer
• Confusing bitwise XOR (^) with power
• Missing base case for exponent 0

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

int fastPow(int base, int exp) {
    if (exp == 0) return 1;
    int half = fastPow(base, exp / 2);
    if (exp % 2 == 0) return half * half;
    else return base * half * half;
}

int main() {
    printf("%d", fastPow(2, 5));
    return 0;
}

medium

A. 25

B. 32

C. 10

D. 16

Solution

1. Step 1: Trace fastPow(2, 5)

   fastPow(2,5) calls fastPow(2,2), which calls fastPow(2,1), which calls fastPow(2,0)=1. Then compute up: fastPow(2,1)=2*1*1=2, fastPow(2,2)=2*2=4, fastPow(2,5)=2*4*4=32.

2. Step 2: Confirm output

   The final printed value is 32.

3. Final Answer:

   32 -> Option B

4. Quick Check:

   2^5 = 32 [OK]

Hint: Calculate powers by halving exponent and squaring [OK]

Common Mistakes:

• Confusing multiplication order
• Forgetting base case returns 1
• Miscomputing odd exponent step

4. Identify the bug in the following fast exponentiation code and select the correct fix:

int fastPow(int base, int exp) {
    if (exp == 0) return 1;
    int half = fastPow(base, exp / 2);
    if (exp % 2 == 0) return half * half;
    else return base * half;
}

medium

A. Change exp / 2 to exp - 1;

B. Change base case to if (exp == 1) return base;

C. Change last line to return base * half * half;

D. No bug, code is correct

Solution

1. Step 1: Analyze odd exponent case

   For odd exponent, result should be base * half * half, but code returns base * half only, missing one multiplication.

2. Step 2: Fix the return statement

   Change last line to return base * half * half to correctly compute power for odd exponents.

3. Final Answer:

   Change last line to return base * half * half; -> Option C

4. Quick Check:

   Odd exponent step needs base * half * half [OK]

Hint: Remember odd exponent multiplies base once more [OK]

Common Mistakes:

• Returning base * half instead of base * half * half
• Changing base case incorrectly
• Replacing exp / 2 with exp - 1

5. You want to compute pow(base, exponent) modulo m efficiently using fast exponentiation. Which modification should you apply to the standard fast exponentiation algorithm to handle large numbers without overflow?

hard

A. Use floating point arithmetic instead of integers

B. Only apply modulo at the final return value

C. Increase the size of integer variables to long long

D. Apply modulo operation after each multiplication step

Solution

1. Step 1: Understand overflow risk

   Multiplying large numbers can overflow integer limits before modulo is applied.

2. Step 2: Apply modulo after each multiplication

   To avoid overflow and keep numbers small, apply modulo after every multiplication step in fast exponentiation.

3. Final Answer:

   Apply modulo operation after each multiplication step -> Option D

4. Quick Check:

   Modulo after each multiply prevents overflow [OK]

Hint: Modulo after every multiply keeps numbers small [OK]

Common Mistakes:

• Applying modulo only once at the end
• Using floating point causing precision errors
• Relying on bigger integer types without modulo