# Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Objec­tive:  The max­i­mum sub­ar­ray prob­lem is the task of find­ing the con­tigu­ous sub­ar­ray within a one-dimensional array of num­bers which has the largest sum.

Exam­ple:

```int [] A = {−2, 1, −3, 4, −1, 2, 1, −5, 4};
Output: contiguous subarray with the largest sum is 4, −1, 2, 1, with sum 6.
```

Approach:

Ear­lier we have seen how to solve this prob­lem using Kadane’s Algo­rithm and using Dynamic pro­gram­ming. In this article, we will solve the problem using divide and conquer.

1.     Task is to find out the subarray which has the largest sum. So we need to find out the 2 indexes (left index and right index) between which the sum is maximum.

2.     Divide the problem into 2 parts, the left half and the right half.

1. Now we can conclude the final result will be in one of the three possibilities.
1. The left half of the array. (Left index and right index both are in the left half of the array).
2. The right half of the array. (Left index and right index both are in the right half of the array).
3. The result will cross the middle of the array. (Left index in the left half of the array and right index in the right half of the array).
2. Solve all three and return the maximum among them.
3. The left half and right half of the array will be solved recursively.

Code:

Output:

```Maximum Sub Array sum is : 17
```