Recursion Concept and Call Stack Visualization in DSA Python - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is recursion in programming?

Recursion is when a function calls itself to solve smaller parts of a problem until it reaches a simple case it can solve directly.

beginner

What is a base case in recursion?

A base case is the simplest situation in a recursive function where the function stops calling itself and returns a result directly.

intermediate

How does the call stack help in recursion?

The call stack keeps track of all the active function calls. Each recursive call adds a new layer to the stack until the base case is reached, then the stack unwinds as results return.

beginner

Consider this code snippet:

def factorial(n):
  if n == 1:
    return 1
  else:
    return n * factorial(n-1)

What happens when factorial(3) is called?

factorial(3) calls factorial(2), which calls factorial(1). factorial(1) returns 1 (base case). Then factorial(2) returns 2 * 1 = 2, and factorial(3) returns 3 * 2 = 6.

beginner

Why is it important to have a base case in recursion?

Without a base case, the function would call itself forever, causing the program to crash or run out of memory.

What does a recursive function always need to stop calling itself?

A A variable

B A loop

C A base case

D An error

A base case tells the recursive function when to stop calling itself.

In recursion, what does the call stack do?

A Stores all active function calls

B Deletes old functions

C Runs functions in parallel

D Prevents recursion

The call stack keeps track of all active function calls, including recursive ones.

What will factorial(1) return in a typical factorial recursive function?

A 0

B Error

C n

D 1

factorial(1) returns 1 as the base case.

What happens if a recursive function has no base case?

A It returns 0

B It runs forever until error

C It stops immediately

D It runs once

Without a base case, recursion never stops and causes a crash.

Which of these is a real-life example of recursion?

A Russian nesting dolls

B A single book

C A flat table

D A bicycle

Russian nesting dolls contain smaller dolls inside, like recursive calls inside calls.

Explain how recursion works using the example of calculating factorial of a number.

Think about how factorial(3) breaks down into smaller factorials.

Describe the role of the call stack in recursion and what happens when the base case is reached.

Imagine stacking plates and then removing them one by one.

Practice

1. What does recursion mean in programming?
def recurse():
recurse()


easy

A. A function calling itself to solve smaller parts of a problem

B. A loop that runs forever

C. A function that never ends

D. A way to store data in a list

Solution

1. Step 1: Understand recursion definition

   Recursion is when a function calls itself to break down a problem into smaller parts.

2. Step 2: Match with options

   A function calling itself to solve smaller parts of a problem correctly describes recursion as self-calling function for smaller problems.

3. Final Answer:

   A function calling itself to solve smaller parts of a problem -> Option A

4. Quick Check:

   Recursion = self-calling function [OK]

Hint: Recursion means function calls itself to solve smaller parts [OK]

Common Mistakes:

• Confusing recursion with infinite loops
• Thinking recursion is just a loop
• Believing recursion stores data like lists

2. Which of the following is the correct syntax to define a recursive function in Python?

easy

A. def recurse(): recurse()

B. def recurse(): return recurse()

C. def recurse(): recurse() return

D. def recurse(): print('recurse')

Solution

1. Step 1: Check function syntax for recursion

   A recursive function must call itself. It does not always require a return statement unless the return value is used.

2. Step 2: Analyze options

   def recurse(): recurse() correctly defines a recursive function that calls itself.

3. Final Answer:

   def recurse(): recurse() -> Option A

4. Quick Check:

   Recursive call without return is valid syntax [OK]

Hint: Recursive function must call itself; return is optional if return value unused [OK]

Common Mistakes:

• Missing recursive call
• Incorrect use of return
• Confusing print statement with recursion

3. What is the output of this code?

def countdown(n):
    if n == 0:
        return 'Done'
    else:
        print(n)
        return countdown(n-1)

countdown(3)

medium

A. Done

B. 3 2 1 Done

C. 3 2 1

D. 1 2 3 Done

Solution

1. Step 1: Trace recursive calls and prints

   Function prints n then calls countdown(n-1) until n=0, then returns 'Done'. So prints 3, 2, 1 in order.

2. Step 2: Understand return value and print output

   Only numbers 3, 2, 1 are printed. 'Done' is returned but not printed, so output shows numbers only.

3. Final Answer:

   3 2 1 -> Option C

4. Quick Check:

   Prints countdown down to 1 then returns 'Done' [OK]

Hint: Print happens before recursive call, so numbers print descending [OK]

Common Mistakes:

• Thinking 'Done' is printed automatically
• Confusing order of printed numbers
• Ignoring base case return

4. Find the error in this recursive function:

def sum_to_n(n):
    if n == 1:
        return 1
    else:
        return n + sum_to_n(n)

print(sum_to_n(3))

medium

A. Missing base case

B. Recursive call uses n instead of n-1

C. Function does not return anything

D. Syntax error in function definition

Solution

1. Step 1: Check recursive call parameter

   Recursive call should reduce n by 1 to approach base case, but it calls sum_to_n(n) again causing infinite recursion.

2. Step 2: Identify correct fix

   Change recursive call to sum_to_n(n-1) to reduce n each time and reach base case.

3. Final Answer:

   Recursive call uses n instead of n-1 -> Option B

4. Quick Check:

   Recursive call must reduce n to avoid infinite loop [OK]

Hint: Recursive call must move toward base case by changing argument [OK]

Common Mistakes:

• Calling function with same argument causing infinite recursion
• Forgetting to reduce argument in recursion
• Confusing base case presence

5. Given this recursive function to calculate factorial:

def factorial(n):
    if n == 0:
        return 1
    else:
        return n * factorial(n-1)

What is the call stack sequence when calling factorial(3)?

hard

A. factorial(1) -> factorial(2) -> factorial(3)

B. factorial(0) -> factorial(1) -> factorial(2) -> factorial(3)

C. factorial(3) -> factorial(3) -> factorial(3)

D. factorial(3) -> factorial(2) -> factorial(1) -> factorial(0)

Solution

1. Step 1: Understand recursive calls order

   factorial(3) calls factorial(2), which calls factorial(1), which calls factorial(0) base case.

2. Step 2: Trace call stack sequence

   Calls go down from 3 to 0 before returning results back up the stack.

3. Final Answer:

   factorial(3) -> factorial(2) -> factorial(1) -> factorial(0) -> Option D

4. Quick Check:

   Recursive calls descend to base case 0 [OK]

Hint: Recursive calls go down to base case before returning [OK]

Common Mistakes:

• Thinking calls go from base case up
• Repeating same call multiple times
• Skipping base case call