Opening the reading…
Opening the reading…
DSA FUNDAMENTALS › RECURSION BASICS
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Implement fastPower so it computes 3^13 using one recursive call for each non-base invocation. Store the result for the halved exponent and reuse it for the even or odd case.
OUTPUT
Sample1594323
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.