Why Divide and Conquer Strategy and Recurrence Relations in DSA Typescript?

The Big Idea

Discover how breaking big problems into small pieces can save you hours of work!

The Scenario

Imagine you have a huge pile of papers to sort by date. Doing it one by one takes forever, and if you try to remember everything, you get confused and make mistakes.

The Problem

Sorting or solving big problems step-by-step without a plan is slow and tiring. You might repeat work or get lost in details, making errors and wasting time.

The Solution

Divide and conquer breaks the big problem into smaller, easier parts, solves each part quickly, and then combines the answers. This way, you work smarter, not harder.

Before vs After

✗ Before

function sortArray(arr: number[]): number[] {
  // Compare each element with every other element
  for (let i = 0; i < arr.length; i++) {
    for (let j = i + 1; j < arr.length; j++) {
      if (arr[i] > arr[j]) {
        let temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
      }
    }
  }
  return arr;
}

✓ After

function mergeSort(arr: number[]): number[] {
  if (arr.length <= 1) return arr;
  const mid = Math.floor(arr.length / 2);
  const left = mergeSort(arr.slice(0, mid));
  const right = mergeSort(arr.slice(mid));
  return merge(left, right);
}

function merge(left: number[], right: number[]): number[] {
  const result: number[] = [];
  while (left.length && right.length) {
    if (left[0] < right[0]) result.push(left.shift()!);
    else result.push(right.shift()!);
  }
  return result.concat(left, right);
}

What It Enables

It enables solving large problems efficiently by breaking them into smaller, manageable pieces and combining solutions quickly.

Real Life Example

When you organize a big photo album, you might first sort photos by year, then by month, then by day, making the task easier and faster.

Key Takeaways

Divide and conquer splits problems into smaller parts.

It solves each part and merges results for the final answer.

Recurrence relations help understand how fast these solutions work.

Practice

1. What is the main idea behind the Divide and Conquer strategy in algorithms?

easy

A. Break the problem into smaller subproblems, solve them independently, then combine results

B. Solve the problem by trying all possible solutions one by one

C. Use a single loop to iterate through all elements

D. Store all intermediate results to avoid repeated calculations

Solution

1. Step 1: Understand the divide and conquer approach

   It splits a big problem into smaller parts that are easier to solve.

2. Step 2: Combine the solutions of smaller parts

   After solving subproblems, their results are merged to get the final answer.

3. Final Answer:

   Break the problem into smaller subproblems, solve them independently, then combine results -> Option A

4. Quick Check:

   Divide and conquer = split, solve, combine [OK]

Hint: Divide big problems into smaller parts, solve, then merge [OK]

Common Mistakes:

• Confusing divide and conquer with brute force
• Thinking it uses only loops without recursion
• Mixing it up with dynamic programming

2. Which of the following is the correct recurrence relation for the Merge Sort algorithm?

easy

A. T(n) = 3T(n/3) + O(n^2)

B. T(n) = 2T(n/2) + O(n)

C. T(n) = T(n/2) + O(1)

D. T(n) = T(n-1) + O(1)

Solution

1. Step 1: Recall Merge Sort process

   Merge Sort splits array into two halves, sorts each half, then merges.

2. Step 2: Write recurrence relation

   It calls itself twice on half size (2T(n/2)) plus merging cost O(n).

3. Final Answer:

   T(n) = 2T(n/2) + O(n) -> Option B

4. Quick Check:

   Merge Sort recurrence = 2T(n/2) + n [OK]

Hint: Merge sort splits in two, merges in linear time [OK]

Common Mistakes:

• Using T(n-1) instead of T(n/2)
• Confusing merge cost with recursive calls
• Choosing cubic or quadratic terms incorrectly

3. What is the output of the following TypeScript function that uses divide and conquer to find the maximum element?

function findMax(arr: number[], left: number, right: number): number {
  if (left === right) return arr[left];
  const mid = Math.floor((left + right) / 2);
  const maxLeft = findMax(arr, left, mid);
  const maxRight = findMax(arr, mid + 1, right);
  return maxLeft > maxRight ? maxLeft : maxRight;
}

const array = [3, 5, 1, 8, 2];
console.log(findMax(array, 0, array.length - 1));

medium

A. 3

B. 5

C. 8

D. 2

Solution

1. Step 1: Understand the function logic

   The function splits the array into halves recursively and compares max values.

2. Step 2: Trace the recursive calls on array [3,5,1,8,2]

   Max in left half [3,5,1] is 5; max in right half [8,2] is 8; final max is 8.

3. Final Answer:

   8 -> Option C

4. Quick Check:

   Max element found by divide and conquer = 8 [OK]

Hint: Divide array, find max in halves, pick bigger [OK]

Common Mistakes:

• Returning min instead of max
• Incorrect mid calculation causing infinite recursion
• Mixing indices causing wrong subarray

4. Identify the error in the following recurrence relation and fix it:

T(n) = 2T(n/2) + O(n^2)

This recurrence is supposed to represent the time complexity of a divide and conquer algorithm similar to Merge Sort.

medium

A. Change O(n^2) to O(n) because merging takes linear time

B. Change 2T(n/2) to T(n-1) because it is not dividing

C. Change O(n^2) to O(log n) because merging is logarithmic

D. No error, the recurrence is correct

Solution

1. Step 1: Analyze the merging cost in divide and conquer

   In Merge Sort-like algorithms, merging two halves takes O(n) time, not O(n^2).

2. Step 2: Correct the recurrence relation

   Replace O(n^2) with O(n) to reflect the linear merging cost.

3. Final Answer:

   Change O(n^2) to O(n) because merging takes linear time -> Option A

4. Quick Check:

   Merging cost = O(n), not O(n^2) [OK]

Hint: Merging in divide and conquer is linear, not quadratic [OK]

Common Mistakes:

• Assuming merging is quadratic
• Changing recursive calls incorrectly
• Ignoring the cost of merging step

5. Given the recurrence relation T(n) = 3T(n/3) + n, what is the time complexity of the algorithm using the Master Theorem?

hard

A. O(log n)

B. O(n^2)

C. O(n^{\log_3 3}) = O(n)

D. O(n log n)

Solution

1. Step 1: Identify parameters for Master Theorem

   Here, a=3, b=3, f(n)=n. Calculate log_b(a) = log_3(3) = 1.

2. Step 2: Compare f(n) with n^{log_b(a)}

   f(n) = n and n^{log_b(a)} = n^1 = n, so f(n) = Theta(n^{log_b(a)}).

3. Step 3: Apply Master Theorem case 2

   When f(n) = Theta(n^{log_b(a)}), T(n) = Theta(n^{log_b(a)} log n) = Theta(n log n).

4. Final Answer:

   O(n log n) -> Option D

5. Quick Check:

   Master Theorem case 2 gives O(n log n) [OK]

Hint: Use Master Theorem: compare f(n) with n^{log_b(a)} [OK]

Common Mistakes:

• Ignoring the log factor in case 2
• Confusing log base or parameters a and b
• Choosing linear time incorrectly