Why Recursion Exists and What Loops Cannot Express Cleanly in DSA Typescript - Performance Analysis

Time Complexity: Why Recursion Exists and What Loops Cannot Express Cleanly

O(n)

Understanding Time Complexity

We explore why recursion is useful and how it differs from loops in expressing repeated tasks.

We want to understand how the time cost grows when using recursion compared to loops.

Scenario Under Consideration

Analyze the time complexity of this recursive function that calculates factorial.

function factorial(n: number): number {
  if (n <= 1) return 1;
  return n * factorial(n - 1);
}
    

This function calls itself to multiply numbers from n down to 1.

Identify Repeating Operations

Look for repeated actions in the code.

• Primary operation: Recursive call to factorial with n-1.
• How many times: Exactly n times until base case (n=1) is reached.

How Execution Grows With Input

Each call waits for the next call to finish, so the total steps grow with n.

Input Size (n)	Approx. Operations
10	10 multiplications and calls
100	100 multiplications and calls
1000	1000 multiplications and calls

Pattern observation: The number of operations grows directly with n, linearly.

Final Time Complexity

Time Complexity: O(n)

This means the time to complete grows in a straight line as n gets bigger.

Common Mistake

[X] Wrong: "Recursion always takes more time than loops."

[OK] Correct: Both recursion and loops can do the same number of steps; recursion just expresses the steps differently.

Interview Connect

Understanding recursion's time cost helps you explain your choices clearly and shows you know when recursion is a good fit.

Self-Check

"What if the factorial function used a loop instead of recursion? How would the time complexity change?"

Practice

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

easy

A. Because recursion can express problems with self-similar subproblems naturally

B. Because loops are slower than recursion in all cases

C. Because recursion uses less memory than loops always

D. Because loops cannot run more than 10 times

Solution

1. Step 1: Understand recursion's nature

   Recursion breaks a problem into smaller versions of itself, which loops cannot express naturally.

2. Step 2: Compare loops and recursion

   Loops repeat fixed steps but cannot easily handle problems defined by self-similar subproblems like tree traversals.

3. Final Answer:

   Because recursion can express problems with self-similar subproblems naturally -> Option A

4. Quick Check:

   Recursion = self-similar problem solving [OK]

Hint: Recursion fits problems breaking into smaller similar parts [OK]

Common Mistakes:

• Thinking loops are always faster
• Believing recursion always uses less memory
• Assuming loops cannot run many times

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

easy

A. function factorial(n: number): number { if (n == 0) return 0; else return n + factorial(n + 1); }

B. function factorial(n: number): number { while (n > 1) n = n - 1; return n; }

C. function factorial(n: number): number { for (let i = 1; i <= n; i++) return i; }

D. function factorial(n: number): number { if (n <= 1) return 1; else return n * factorial(n - 1); }

Solution

1. Step 1: Identify recursive call

   function factorial(n: number): number { if (n <= 1) return 1; else return n * factorial(n - 1); } calls factorial inside itself with n-1, which is recursion.

2. Step 2: Check base case correctness

   function factorial(n: number): number { if (n <= 1) return 1; else return n * factorial(n - 1); } returns 1 when n <= 1, preventing infinite calls.

3. Final Answer:

   function factorial(n: number): number { if (n <= 1) return 1; else return n * factorial(n - 1); } -> Option D

4. Quick Check:

   Recursive call with base case = function factorial(n: number): number { if (n <= 1) return 1; else return n * factorial(n - 1); } [OK]

Hint: Look for function calling itself with smaller input [OK]

Common Mistakes:

• Missing base case causing infinite recursion
• Using loops instead of recursive calls
• Incorrect base case values

3. What is the output of this TypeScript code?

function printNumbers(n: number): void {
  if (n === 0) return;
  printNumbers(n - 1);
  console.log(n);
}
printNumbers(3);

medium

A. 3 2 1

B. 1 2 3

C. 3 2 1 0

D. 0 1 2 3

Solution

1. Step 1: Trace recursive calls

   printNumbers(3) calls printNumbers(2), which calls printNumbers(1), then printNumbers(0) returns immediately.

2. Step 2: Understand console.log order

   After reaching base case, console.log prints n while unwinding: prints 1, then 2, then 3.

3. Final Answer:

   1 2 3 -> Option B

4. Quick Check:

   Recursion unwinds printing ascending numbers [OK]

Hint: Recursion prints after call, so output is ascending [OK]

Common Mistakes:

• Assuming print before recursive call prints descending
• Including 0 in output incorrectly
• Confusing order of prints

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

function sumToN(n: number): number {
  return n + sumToN(n - 1);
}

medium

A. Add a base case to stop recursion when n <= 0

B. Change return to console.log to print values

C. Replace recursion with a for loop

D. Remove the parameter n

Solution

1. Step 1: Identify missing base case

   The function calls itself without stopping condition, causing infinite recursion.

2. Step 2: Add base case to stop recursion

   Adding if (n <= 0) return 0; stops recursion and returns correct sum.

3. Final Answer:

   Add a base case to stop recursion when n <= 0 -> Option A

4. Quick Check:

   Base case prevents infinite recursion [OK]

Hint: Always include base case to stop recursion [OK]

Common Mistakes:

• Forgetting base case causes stack overflow
• Changing return to console.log does not fix recursion
• Removing parameter breaks logic

5. You want to flatten a nested array of numbers like [1, [2, [3, 4], 5], 6] into a single array [1, 2, 3, 4, 5, 6]. Why is recursion a better choice than loops here?

hard

A. Because recursion uses less memory than loops for arrays

B. Because loops can only flatten arrays with one level of nesting

C. Because recursion naturally handles unknown levels of nesting by calling itself

D. Because loops cannot access array elements

Solution

1. Step 1: Understand nested structure

   The array has unknown depth of nested arrays, which loops alone cannot easily handle.

2. Step 2: Recursion handles unknown depth

   Recursion calls itself on nested arrays, flattening all levels naturally without complex loops.

3. Final Answer:

   Because recursion naturally handles unknown levels of nesting by calling itself -> Option C

4. Quick Check:

   Recursion = natural for unknown nested depth [OK]

Hint: Recursion handles unknown nested depth easily [OK]

Common Mistakes:

• Thinking loops can flatten any nested array easily
• Believing recursion always uses less memory
• Assuming loops cannot access array elements