Divide and Conquer Strategy and Recurrence Relations in DSA C - Build from Scratch

Understanding Divide and Conquer Strategy with Recurrence Relations

📖 Scenario: Imagine you have a large pile of books that you want to count quickly. Instead of counting each book one by one, you decide to split the pile into smaller piles, count each smaller pile, and then add those counts together. This is similar to the divide and conquer strategy used in algorithms.

🎯 Goal: You will write a simple C program that uses the divide and conquer approach to count items by splitting the problem into smaller parts. You will also see how the number of steps relates to a recurrence relation.

📋 What You'll Learn

Create a function that counts items by dividing the problem into two halves

Use a base case to stop dividing when the problem is small enough

Use a variable to keep track of the total count

Print the final count after applying the divide and conquer method

💡 Why This Matters

🌍 Real World

Divide and conquer is used in sorting algorithms like merge sort and quicksort, which help organize data efficiently.

💼 Career

Understanding divide and conquer and recurrence relations is essential for software engineers to design efficient algorithms and solve complex problems.

1

Create the initial array of items

Create an integer array called items with these exact values: 5, 8, 3, 6, 2, 7, 4, 1.

DSA C

# Create the integer array called items with the given values
// Your code here

Hint

Use int items[] = {5, 8, 3, 6, 2, 7, 4, 1}; to create the array and int n = 8; for its size.

2

Add a function prototype for divide and conquer count

Add a function prototype called count_items that takes two integers start and end as parameters and returns an integer.

DSA C

#include 

int items[] = {5, 8, 3, 6, 2, 7, 4, 1};
int n = 8;

// Add the function prototype for count_items
// Your code here

Hint

Write int count_items(int start, int end); before main.

3

Implement the divide and conquer counting function

Write the function count_items that returns 0 if start is greater than end. If start equals end, return 1. Otherwise, find the middle index and return the sum of count_items(start, mid) and count_items(mid + 1, end).

DSA C

#include 

int items[] = {5, 8, 3, 6, 2, 7, 4, 1};
int n = 8;

int count_items(int start, int end) {
    // Your code here
}

int main() {
    return 0;
}

Hint

Use the base cases for empty and single element ranges, then divide the range and sum the counts recursively.

4

Print the total count using divide and conquer

In main, call count_items(0, n - 1) and print the result with printf using the format "Total count: %d\n".

DSA C

#include 

int items[] = {5, 8, 3, 6, 2, 7, 4, 1};
int n = 8;

int count_items(int start, int end) {
    if (start > end) {
        return 0;
    }
    if (start == end) {
        return 1;
    }
    int mid = (start + end) / 2;
    return count_items(start, mid) + count_items(mid + 1, end);
}

int main() {
    // Your code here
}

Hint

Call count_items(0, n - 1) and print the result with printf("Total count: %d\n", total);.

Practice

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

easy

A. Use a single loop to solve the problem iteratively

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

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

D. Store all intermediate results to avoid repeated calculations

Solution

1. Step 1: Understand Divide and Conquer approach

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

2. Step 2: Combine solutions of subproblems

   After solving smaller parts, their results are combined to get the final answer.

3. Final Answer:

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

4. Quick Check:

   Divide and Conquer = Break, Solve, Combine [OK]

Hint: Divide big problem into parts, solve parts, then combine [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 on an array of size n?

easy

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

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

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

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

Solution

1. Step 1: Recall Merge Sort process

   Merge Sort splits array into two halves, sorts each half recursively, then merges in O(n) time.

2. Step 2: Write recurrence relation

   It calls itself twice on size n/2 plus linear merge step, so T(n) = 2T(n/2) + O(n).

3. Final Answer:

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

4. Quick Check:

   Merge Sort recurrence = 2 halves + merge O(n) [OK]

Hint: Two halves plus linear merge step means 2T(n/2)+n [OK]

Common Mistakes:

• Using T(n-1) instead of T(n/2)
• Ignoring the merge step cost
• Confusing with quicksort recurrence

3. Consider the following C code implementing a divide and conquer function:

int func(int n) {
    if (n <= 1) return 1;
    return func(n/2) + func(n/2) + n;
}

What is the time complexity T(n) of this function?

medium

A. O(n^2)

B. O(n)

C. O(log n)

D. O(n log n)

Solution

1. Step 1: Identify recurrence relation

   The function calls itself twice on n/2 plus does O(n) work, so T(n) = 2T(n/2) + n.

2. Step 2: Solve recurrence using Master Theorem

   For T(n) = 2T(n/2) + n, the solution is O(n log n).

3. Final Answer:

   O(n log n) -> Option D

4. Quick Check:

   2 calls on half + linear work = n log n [OK]

Hint: Two halves plus linear work means n log n time [OK]

Common Mistakes:

• Thinking it is O(n) by ignoring recursive calls
• Confusing with O(log n) for single call
• Mistaking it for quadratic O(n^2)

4. The following recurrence relation is given:

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

There is a mistake in the code implementing this recurrence. Which fix will correct the recurrence to match the intended divide and conquer approach?

medium

A. Change the recursive calls to 3T(n/3) and keep n^2 as extra work

B. Change the extra work from n^2 to n log n

C. Change the recursive calls to T(n-1) and keep n^2

D. Change the recursive calls to 2T(n/2) and keep n^2

Solution

1. Step 1: Understand the recurrence meaning

   3T(n/3) means dividing problem into 3 equal parts recursively, plus n^2 extra work.

2. Step 2: Fix code to match recurrence

   Ensure code calls itself 3 times on n/3 size and does n^2 work outside recursion.

3. Final Answer:

   Change the recursive calls to 3T(n/3) and keep n^2 as extra work -> Option A

4. Quick Check:

   3 recursive calls on n/3 + n^2 work = 3T(n/3)+n^2 [OK]

Hint: Match recursive calls count and size to recurrence exactly [OK]

Common Mistakes:

• Changing extra work without fixing recursive calls
• Using wrong subproblem size like n-1
• Reducing calls to 2 instead of 3

5. You have a problem of size n that you divide into 4 subproblems each of size n/2. The extra work done outside the recursive calls is O(n^2). What is the time complexity T(n) of this divide and conquer algorithm?

hard

A. O(n^2 log n)

B. O(n^3)

C. O(n^2)

D. O(n log n)

Solution

1. Step 1: Write the recurrence relation

   Since there are 4 subproblems each size n/2 and extra work n^2, T(n) = 4T(n/2) + n^2.

2. Step 2: Apply Master Theorem

   Here, a=4, b=2, f(n)=n^2. Calculate log_b(a) = log_2(4) = 2. Since f(n) = Theta(n^2), it matches n^{log_b(a)}.

3. Step 3: Determine complexity

   By Master Theorem case 2, T(n) = Theta(n^2 log n).

4. Final Answer:

   O(n^2 log n) -> Option A

5. Quick Check:

   4 calls on half + n^2 work = n^2 log n [OK]

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

Common Mistakes:

• Ignoring the log factor in complexity
• Confusing number of subproblems with size
• Mistaking it for cubic or linear complexity