and 2 others joined a min ago.
0
5.7kviews
Explain Maximum subarray problem. How it is resolved by divide and conquer algorithm. Also analyze your algorithm.
1 Answer
3
276views
written 3.8 years ago by
binitamayekar
★ 6.7k
|
• modified 3.8 years ago |
Maximum Subarray Problem
- The Maximum Subarray Problem finds out the series of contiguous elements with the maximum sum in any given array.
- If all the elements in an array are positive then it is easy, to find the sum of all the elements of the array and it has the …
and 4 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.