Why Recursion Exists and What Loops Cannot Express Cleanly in DSA Go - Quick Recap

Recall & Review

beginner

What is recursion in simple terms?

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

Why do we need recursion when we have loops?

Some problems, like exploring tree structures or solving puzzles, are easier and cleaner to solve with recursion because loops can't naturally handle nested or branching steps.

intermediate

Give an example of a problem that loops cannot express cleanly but recursion can.

Walking through a family tree or exploring folders inside folders is hard with loops but easy with recursion because recursion naturally handles nested layers.

beginner

What is a base case in recursion?

A base case is the simplest part of the problem that recursion can solve directly without calling itself again. It stops the recursion from going forever.

intermediate

How does recursion help in expressing problems with branching paths?

Recursion can call itself multiple times for each branch, naturally exploring all paths one by one, which is hard to do cleanly with loops.

What stops a recursive function from running forever?

A A variable that counts loops

B A loop inside the function

C A base case that ends recursion

D A timer that stops the function

A base case is the condition where the recursive function stops calling itself, preventing infinite recursion.

Which problem is easier to solve with recursion than loops?

A Finding the largest number in a list

B Exploring nested folders

C Summing numbers from 1 to 10

D Printing numbers from 1 to 5

Exploring nested folders involves branching and layers, which recursion handles naturally, unlike simple loops.

What does recursion do when it calls itself?

A Repeats the same step without change

B Creates a loop

C Ends the program

D Solves a smaller part of the problem

Each recursive call works on a smaller or simpler part of the problem until it reaches the base case.

Why are loops not good for problems with branching paths?

A Loops only handle one path at a time

B Loops are slower than recursion

C Loops cannot repeat

D Loops use more memory

Loops handle one sequence of steps, but branching paths require exploring multiple paths, which recursion can do by calling itself multiple times.

Which of these is a key part of writing a recursive function?

A Defining a base case

B Using only loops

C Avoiding function calls

D Using global variables

Defining a base case is essential to stop recursion and avoid infinite calls.

Explain why recursion is useful for problems with nested or branching structures compared to loops.

Think about how folders inside folders or family trees are explored.

Describe what a base case is and why it is important in recursion.

Without it, recursion would never stop.

Practice

1. Why do we use recursion instead of loops in some problems?

easy

A. Because recursion always uses less memory than loops

B. Because loops are slower than recursion in all cases

C. Because recursion can express problems with self-similar structure more naturally

D. Because loops cannot perform repeated actions

Solution

1. Step 1: Understand recursion's purpose

   Recursion is useful when a problem can be broken down into smaller versions of itself, like tree traversal or factorial calculation.

2. Step 2: Compare recursion and loops

   Loops repeat actions but do not naturally express self-similar or nested structures, which recursion handles clearly.

3. Final Answer:

   Because recursion can express problems with self-similar structure more naturally -> Option C

4. Quick Check:

   Recursion = natural for self-similar problems [OK]

Hint: Recursion fits problems with repeated smaller subproblems [OK]

Common Mistakes:

• Thinking loops are always faster
• Believing recursion always uses less memory
• Assuming loops cannot repeat actions

2. Which of the following is the correct syntax for a recursive function in Go?

easy

A. func factorial(n int) int { if n == 0 { return 1 } else { return n * factorial(n-1) } }

B. func factorial(n int) { if n == 0 { return 1 } else { return n * factorial(n-1) } }

C. func factorial(n int) int { for n > 0 { return n * factorial(n-1) } return 1 }

D. func factorial(n int) int { if n == 0 { return 0 } else { return n * factorial(n-1) } }

Solution

1. Step 1: Check function return type and base case

   func factorial(n int) int { if n == 0 { return 1 } else { return n * factorial(n-1) } } correctly defines a function returning int and has a base case returning 1 when n == 0.

2. Step 2: Verify recursive call and return statement

   func factorial(n int) int { if n == 0 { return 1 } else { return n * factorial(n-1) } } correctly returns n multiplied by factorial(n-1), matching factorial definition.

3. Final Answer:

   func factorial(n int) int { if n == 0 { return 1 } else { return n * factorial(n-1) } } -> Option A

4. Quick Check:

   Correct recursive syntax = func factorial(n int) int { if n == 0 { return 1 } else { return n * factorial(n-1) } } [OK]

Hint: Look for base case and correct return type in recursion [OK]

Common Mistakes:

• Missing return type in function signature
• Returning wrong base case value
• Using loops instead of recursion incorrectly

3. What is the output of this Go code?

func sum(n int) int {
    if n == 0 {
        return 0
    }
    return n + sum(n-1)
}

func main() {
    fmt.Println(sum(3))
}

medium

A. Error: undefined fmt

B. 3

C. 0

D. 6

Solution

1. Step 1: Analyze the sum function logic

   The sum function recursively adds numbers from n down to 0, so sum(3) = 3 + 2 + 1 + 0 = 6.

2. Step 2: Check code completeness and imports

   The code uses fmt.Println but does not import "fmt", causing a compile error.

3. Final Answer:

   Error: undefined fmt -> Option A

4. Quick Check:

   Missing import causes error = Error: undefined fmt [OK]

Hint: Check for missing imports before output [OK]

Common Mistakes:

• Assuming output is 6 without checking imports
• Ignoring compile errors
• Confusing recursion base case

4. Identify the error in this recursive Go function and fix it:

func countdown(n int) {
    if n == 0 {
        fmt.Println("Done")
    }
    fmt.Println(n)
    countdown(n-1)
}

medium

A. Function should return int instead of void

B. Missing else causes infinite recursion when n == 0

C. Base case should print n instead of "Done"

D. No error, function works correctly

Solution

1. Step 1: Analyze base case and recursion call

   When n == 0, it prints "Done" but then continues to print 0 and calls countdown(-1), causing infinite recursion.

2. Step 2: Fix by adding else to stop recursion after base case

   Adding else before printing n and calling countdown(n-1) stops recursion at zero.

3. Final Answer:

   Missing else causes infinite recursion when n == 0 -> Option B

4. Quick Check:

   Base case must stop recursion [OK]

Hint: Ensure base case stops recursion with else or return [OK]

Common Mistakes:

• Not stopping recursion at base case
• Printing after base case without condition
• Changing return type unnecessarily

5. You want to print all paths from root to leaves in a tree structure. Why is recursion better than loops for this task?

hard

A. Because loops always cause infinite loops in trees

B. Because loops cannot traverse trees at all

C. Because recursion uses less memory than loops for trees

D. Because recursion naturally handles branching and backtracking without complex stack management

Solution

1. Step 1: Understand tree traversal complexity

   Tree traversal requires exploring branches and returning to previous nodes, which recursion handles by call stack automatically.

2. Step 2: Compare recursion and loops for branching

   Loops need explicit stack or queue to track nodes, making code complex; recursion simplifies this by implicit call stack.

3. Final Answer:

   Because recursion naturally handles branching and backtracking without complex stack management -> Option D

4. Quick Check:

   Recursion = natural for branching structures [OK]

Hint: Recursion handles branching and backtracking simply [OK]

Common Mistakes:

• Thinking loops cannot traverse trees
• Assuming recursion always uses less memory
• Believing loops cause infinite loops in trees