Ask
Search
Ask Question
Login
×
×
Welcome back.
and 3 others joined a min ago.
Continue with Google
Continue with email
0
3.9k
views
Explain Maximum subarray problem. How it is resolved by divide and conquer algorithm. Also analyze your algorithm.
written
2.2 years ago
by
CoBB
•
50
modified 2.2 years ago by
binitamayekar
★
6.4k
analysis of algorithms
ADD COMMENT
FOLLOW
SHARE
EDIT
1 Answer
3
267
views
written
2.2 years ago
by
binitamayekar
★
6.4k
• modified 2.2 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 …
Create a free account to keep reading this post.
and 5 others joined a min ago.
Continue with Google
Continue with email
ADD COMMENT
SHARE
EDIT
Please
log in
to add an answer.
Community
Users
Levels
Badges
Content
All posts
Tags
Dashboard
Company
About
Team
Privacy
Submit question paper solutions and earn money