Why Dynamic Programming and When Recursion Alone Fails in DSA Typescript - Performance Analysis

Time Complexity: Why Dynamic Programming and When Recursion Alone Fails

O(2^n)

Understanding Time Complexity

We want to see why simple recursion can be slow for some problems and how dynamic programming helps speed things up.

How does the number of repeated calculations affect the time it takes?

Scenario Under Consideration

Analyze the time complexity of this recursive Fibonacci function.

function fib(n: number): number {
  if (n <= 1) return n;
  return fib(n - 1) + fib(n - 2);
}
    

This code calculates the nth Fibonacci number using simple recursion without storing results.

Identify Repeating Operations

Look at what repeats in this code.

• Primary operation: Calling fib recursively twice for each number above 1.
• How many times: Many calls repeat the same fib values again and again, especially for smaller numbers.

How Execution Grows With Input

As n grows, the number of calls grows very fast because each call makes two more calls.

Input Size (n)	Approx. Operations
10	About 177 calls
20	Over 21,000 calls
30	More than 2 million calls

Pattern observation: The calls roughly double with each increase in n, causing very fast growth.

Final Time Complexity

Time Complexity: O(2^n)

This means the time needed doubles with each step up in n, making it very slow for large inputs.

Common Mistake

[X] Wrong: "Recursion always solves problems efficiently because it breaks them down."

[OK] Correct: Without remembering past results, recursion repeats the same work many times, causing slow performance.

Interview Connect

Understanding when recursion alone is slow and how dynamic programming improves it shows your skill in writing efficient code for real problems.

Self-Check

"What if we add a memory to store results (memoization)? How would the time complexity change?"

Practice

1. Why do we use dynamic programming instead of just recursion for some problems?

easy

A. Because recursion alone can repeat the same calculations many times, making it slow.

B. Because recursion cannot solve problems with multiple steps.

C. Because dynamic programming uses loops instead of functions.

D. Because recursion always causes errors in large problems.

Solution

1. Step 1: Understand recursion's limitation

   Recursion solves problems by calling itself but often recalculates the same results multiple times.

2. Step 2: Recognize dynamic programming's advantage

   Dynamic programming stores results of subproblems to avoid repeated work, making it faster.

3. Final Answer:

   Because recursion alone can repeat the same calculations many times, making it slow. -> Option A

4. Quick Check:

   Recursion repeats work, DP saves results [OK]

Hint: DP saves repeated results to speed up recursion [OK]

Common Mistakes:

• Thinking recursion cannot handle multiple steps
• Believing DP only uses loops
• Assuming recursion always causes errors

2. Which of the following TypeScript function signatures correctly shows a recursive function with memoization parameter for dynamic programming?

easy

A. function fib(n: number): number[]

B. function fib(n: string, memo: number): number

C. function fib(memo: number[], n: number): void

D. function fib(n: number, memo: number[] = []): number

Solution

1. Step 1: Check parameter types and order

   function fib(n: number, memo: number[] = []): number has number n and optional memo array with default empty array, suitable for memoization.

2. Step 2: Verify return type and parameters

   function fib(n: number, memo: number[] = []): number returns number (the Fibonacci number), others have wrong types or order.

3. Final Answer:

   function fib(n: number, memo: number[] = []): number -> Option D

4. Quick Check:

   Correct memo param with default empty array [OK]

Hint: Memo param usually an array with default empty value [OK]

Common Mistakes:

• Swapping parameter order
• Using wrong return type
• Not providing default value for memo

3. What is the output of this TypeScript code snippet?

function fib(n: number, memo: number[] = []): number {
  if (n <= 1) return n;
  if (memo[n] !== undefined) return memo[n];
  memo[n] = fib(n - 1, memo) + fib(n - 2, memo);
  return memo[n];
}
console.log(fib(5));

medium

A. 3

B. 8

C. 5

D. Undefined

Solution

1. Step 1: Trace fib(5) calls with memo

   fib(5) = fib(4) + fib(3), memo stores results to avoid repeats.

2. Step 2: Calculate fib values

   fib(0)=0, fib(1)=1, fib(2)=1, fib(3)=2, fib(4)=3, fib(5)=5.

3. Final Answer:

   5 -> Option C

4. Quick Check:

   Fibonacci of 5 = 5 [OK]

Hint: Memo avoids repeats; fib(5) = 5 [OK]

Common Mistakes:

• Confusing fib(5) with fib(6)
• Ignoring memoization effect
• Assuming output is sum of all calls

4. Identify the bug in this recursive Fibonacci function without memoization:

function fib(n: number): number {
  if (n === 0) return 0;
  if (n === 1) return 1;
  return fib(n - 1) + fib(n - 2);
}
console.log(fib(40));

medium

A. It will cause a stack overflow error for large n.

B. It returns wrong Fibonacci numbers for n > 2.

C. It uses memoization incorrectly.

D. It has a syntax error in the return statement.

Solution

1. Step 1: Analyze recursion depth for fib(40)

   Without memoization, fib(40) causes many repeated calls, leading to deep recursion.

2. Step 2: Understand consequences

   Deep recursion can cause stack overflow or very slow execution, but no syntax or logic errors.

3. Final Answer:

   It will cause a stack overflow error for large n. -> Option A

4. Quick Check:

   Deep recursion without memo causes stack overflow [OK]

Hint: Large n without memo causes stack overflow [OK]

Common Mistakes:

• Thinking it returns wrong values
• Assuming syntax error exists
• Confusing memoization usage

5. You want to find the minimum number of coins to make a sum using recursion. Why is dynamic programming necessary here instead of plain recursion?

function minCoins(coins: number[], sum: number): number {
  if (sum === 0) return 0;
  let res = Infinity;
  for (let coin of coins) {
    if (coin <= sum) {
      let subRes = minCoins(coins, sum - coin);
      if (subRes !== Infinity && subRes + 1 < res) {
        res = subRes + 1;
      }
    }
  }
  return res;
}

hard

A. Because recursion cannot handle arrays as input parameters.

B. Because recursion alone recalculates the same sums multiple times, causing slow performance.

C. Because dynamic programming uses loops instead of recursion.

D. Because recursion always returns Infinity for large sums.

Solution

1. Step 1: Identify repeated subproblems in recursion

   The function calls itself with the same sums multiple times, recalculating results.

2. Step 2: Explain dynamic programming benefit

   DP stores results for sums already computed, avoiding repeated work and speeding up solution.

3. Final Answer:

   Because recursion alone recalculates the same sums multiple times, causing slow performance. -> Option B

4. Quick Check:

   DP saves repeated sum calculations [OK]

Hint: DP caches results to avoid repeated sum calculations [OK]

Common Mistakes:

• Thinking recursion can't handle arrays
• Believing DP replaces recursion with loops
• Assuming recursion returns Infinity always