Question: You are given a one dimensional array that may contain both positive and negative integers. Give an O(n log n) algorithm to find the sum
You are given a one dimensional array that may contain both positive and negative integers. Give an O(n log n) algorithm to find the sum of contiguous (ie. next to one another, in sequence) subarray of numbers which has the largest sum. For example, if the given array is [2, 5, 6, 2, 3, 1, 5, 6], then the maximum subarray sum is 7 (the subarray is marked in boldface). Argue that your algorithm is correct.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
