Fast Exponentiation Power in Log N in DSA Python - 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 half power

↓

Compute half power recursively

↓

Multiply base with square of half power

↓

Return result

The flow checks if exponent is zero, then if even or odd, recursively computes half power, squares it, and multiplies by base if odd.

Execution Sample

DSA Python

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

Computes base raised to exp using recursion and squaring to reduce steps.

Execution Table

Step	Operation	Exponent (exp)	Recursive Call	Return Value	Explanation
1	Call fast_power(2, 10)	10	fast_power(2, 5)		Start with base=2, exp=10
2	Call fast_power(2, 5)	5	fast_power(2, 2)		exp=5 is odd, recurse with exp//2=2
3	Call fast_power(2, 2)	2	fast_power(2, 1)		exp=2 is even, recurse with exp//2=1
4	Call fast_power(2, 1)	1	fast_power(2, 0)		exp=1 is odd, recurse with exp//2=0
5	Call fast_power(2, 0)	0		1	Base case: exp=0 returns 1
6	Return from fast_power(2, 0)	0		1	Return 1 to caller with exp=1
7	Calculate for exp=1 (odd)	1		2	Return base * half * half = 2 * 1 * 1 = 2
8	Return from fast_power(2, 1)	1		2	Return 2 to caller with exp=2
9	Calculate for exp=2 (even)	2		4	Return half * half = 2 * 2 = 4
10	Return from fast_power(2, 2)	2		4	Return 4 to caller with exp=5
11	Calculate for exp=5 (odd)	5		32	Return base * half * half = 2 * 4 * 4 = 32
12	Return from fast_power(2, 5)	5		32	Return 32 to caller with exp=10
13	Calculate for exp=10 (even)	10		1024	Return half * half = 32 * 32 = 1024
14	Return from fast_power(2, 10)	10		1024	Final result 1024 returned
15	End				Exponentiation complete

💡 Recursion ends when exponent reaches 0, returning 1, then results combine back up.

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	N/A	N/A	1	2	4	32	32
return_value	N/A	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, the power can be split as base * (base^(exp//2))^2. The multiplication by base accounts for the extra factor. See steps 7 and 11 in execution_table.

Why does the recursion stop at exponent 0 returning 1?

By definition, any number to the power 0 is 1. This is the base case that stops recursion. See step 5 in execution_table.

How does dividing exponent by 2 reduce the number of steps?

Each recursive call halves the exponent, so the depth of recursion is about log2(exp), making the algorithm much faster than multiplying exp times. See the chain of recursive calls in steps 1 to 5.

Visual Quiz - 3 Questions

Look at the execution_table, what is the return value at step 9 for exponent 2?

A 32

B 2

C 4

D 1

💡 Hint

Check the 'Return Value' column at step 9 in execution_table.

At which step does the recursion reach the base case where exponent is 0?

A Step 7

B Step 5

C Step 1

D Step 13

💡 Hint

Look for the step where 'Exponent (exp)' is 0 and return value is 1.

If the exponent was changed from 10 to 9, how would the number of recursive calls change?

A It would stay about the same (logarithmic depth)

B It would decrease by 1

C It would increase by 1

D It would double

💡 Hint

Check the recursive call pattern in execution_table and variable_tracker; halving exponent controls depth.

Concept Snapshot

Fast Exponentiation (Power) in Log N:
- Use recursion to compute base^exp
- Base case: exp=0 returns 1
- Recursively compute half = base^(exp//2)
- If exp even: result = half * half
- If exp odd: result = base * half * half
- Runs in O(log exp) time, much faster than naive multiplication

Full Transcript

Fast exponentiation calculates the power of a base raised to an exponent quickly by using recursion and squaring. The process checks if the exponent is zero, returning 1 as the base case. If the exponent is even, it recursively computes the power of half the exponent and squares it. If odd, it multiplies the base by the square of the half power. This reduces the number of multiplications from linear to logarithmic in the exponent size. The execution table traces a call with base 2 and exponent 10, showing recursive calls halving the exponent until zero, then combining results back up to get 1024. Variables track the exponent, half power, and return values at each step. Key moments clarify why multiplication by base happens only for odd exponents, why recursion stops at zero, and how halving reduces steps. The visual quiz tests understanding of return values, base case step, and recursion depth changes. This method is efficient and widely used in algorithms requiring fast power calculations.