Suppose that lines 15 and 16 in algorithm 3 (Fig. 2.7) are replaced by
15 int maxLeftSum = maxSubSum( a, left, center - 1 );16 int maxRightSum = maxSubSum( a, center, right );
Would the routine still work?
Figure Algorithm 3

We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.