Computer Science, asked by cmk070902, 10 hours ago

Write an efficient algorithm (better time complexity) to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum. A] = [-2, -3, 4, -1, -2, 1, 5, -3]

Answers

Answered by rockybhai5603
1

Explanation:

For example, if the given array is {-2, -5, 6, -2, -3, 1, 5, -6}, then the maximum subarray sum is 7 (see highlighted elements). Become a ...

Similar questions