Find Maximum Subarray Divide and Conquer in DSA C - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind the Divide and Conquer approach for finding the maximum subarray?

Split the array into two halves, find the maximum subarray in the left half, the right half, and the maximum subarray crossing the middle, then return the maximum of these three.

intermediate

In the Divide and Conquer method, how do we find the maximum subarray crossing the middle point?

Find the maximum sum subarray ending at the middle from the left side and the maximum sum subarray starting at the middle+1 from the right side, then add these two sums.

intermediate

What is the time complexity of the Divide and Conquer algorithm for maximum subarray?

O(n log n), because the array is divided into halves recursively and the crossing subarray is found in linear time at each level.

beginner

Why is the maximum subarray problem a good example to teach Divide and Conquer?

Because it clearly shows how a problem can be split into smaller parts, solved independently, and combined to get the final answer.

beginner

What are the three cases considered in the Divide and Conquer maximum subarray algorithm?

1) Maximum subarray lies entirely in the left half, 2) Maximum subarray lies entirely in the right half, 3) Maximum subarray crosses the middle point.

What does the Divide and Conquer algorithm do first when finding the maximum subarray?

A Splits the array into two halves

B Finds the maximum element

C Sorts the array

D Calculates the sum of all elements

The algorithm starts by splitting the array into two halves to apply divide and conquer.

How is the maximum crossing subarray found?

A By checking all subarrays crossing the middle in O(n^2)

B By using dynamic programming

C By sorting the array

D By finding max sum on left side ending at middle and max sum on right side starting at middle+1

The crossing subarray is found by combining max sums from left and right sides around the middle.

What is the time complexity of the Divide and Conquer maximum subarray algorithm?

A O(n log n)

B O(n^2)

C O(n)

D O(log n)

The algorithm divides the problem recursively and does linear work at each level, resulting in O(n log n).

Which of these is NOT a case considered in the Divide and Conquer maximum subarray algorithm?

A Maximum subarray in right half

B Maximum subarray with all negative numbers

C Maximum subarray crossing the middle

D Maximum subarray in left half

The algorithm considers left, right, and crossing subarrays, not specifically all negative numbers.

Why is the maximum subarray problem suitable for Divide and Conquer?

A Because it requires dynamic programming

B Because it can be solved by sorting

C Because it can be split into smaller subproblems and combined

D Because it needs hashing

Divide and Conquer works well because the problem can be split and combined easily.

Explain the steps of the Divide and Conquer algorithm to find the maximum subarray.

Think about how the problem is divided and how results are combined.

Describe how to find the maximum subarray that crosses the middle point in the Divide and Conquer approach.

Focus on sums around the middle index.