6,716 views
3 votes
3 votes

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.

A

O(n)

B

O(nLogn)

C

O(Logn)

D O(n2)

Correct answer is B. O(nLogn) How? 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Huzaifa0111 asked Aug 27, 2023
157 views