Q290
Given a one-dimensional array of integers, you have to find a sub-array with maximum sum. This is the maximum sub-array sum problem. Which of these methods can be used to solve the problem?
A.
Dynamic programming
B.
Two for loops (naive method)
C.
Divide and conquer
D.
Dynamic programming, naive method and Divide and conquer methods
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board