Why Recursion Exists and What Loops Cannot Express Cleanly in DSA Typescript - 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 already have loops?

Loops repeat actions but can't easily handle problems that break down into smaller similar problems, like tree traversals or factorial calculation. Recursion handles these naturally.

intermediate

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

Calculating factorial of a number or traversing a tree structure are easier with recursion because they involve repeating the same process on smaller parts.

beginner

What is a base case in recursion?

A base case is the simplest situation where the problem can be solved directly without further recursion. It stops the recursive calls.

intermediate

How does recursion help in expressing problems with nested or hierarchical data?

Recursion naturally follows the structure of nested data by calling itself on each smaller part, making code simpler and clearer than complex loops.

What stops a recursive function from calling itself forever?

A An error thrown manually

B A loop inside the function

C A timer that stops the function

D A base case that ends recursion

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

Which problem is easier to solve with recursion than with loops?

A Summing numbers from 1 to 10

B Traversing a tree structure

C Printing numbers 1 to 5

D Repeating a task 3 times

Tree traversal involves nested structures that recursion handles naturally, unlike simple loops.

What does recursion do that loops cannot do cleanly?

A Break a problem into smaller similar problems

B Repeat a fixed number of times

C Run faster

D Use less memory

Recursion breaks problems into smaller parts and solves them similarly, which loops struggle to express clearly.

What is the main role of the base case in recursion?

A To start the recursion

B To speed up the recursion

C To stop the recursion

D To call another function

The base case stops recursion by providing a simple answer without further calls.

Which of these is a recursive problem?

A Calculating factorial of a number

B Finding the largest number in a list

C Adding two numbers

D Printing a message

Factorial calculation naturally uses recursion by multiplying the number by factorial of smaller numbers.

Explain why recursion is useful for problems involving nested or hierarchical data.

Think about how a tree has branches inside branches.

Describe the difference between loops and recursion in solving repetitive problems.

Consider how factorial is calculated.