Question

26 CMRCET GPAT Test Practice | Ge X
+
quiz/
ƏG Practice
.
QUESTION 3
+5 Marks
Maximum Subarray Sum problem is to find the subarray with maximum sum. For
example, given an array {12, -13, -5, 25, -20, 30, 10), the maximum subarray sum is
45. The naive solution for this problem is to calculate sum of all subarrays starting
with every element and return the maximum of all. We can solve this using Divide
and Conquer, what will be the worst case time complexity using Divide and
Conquer.​

Answer 1

Answer:

ddzgkyafniqoikikbdsa