Loading practice questions
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?
Correct Answer: D — Dynamic programming, naïve method and Divide and conquer methods
Explanation:
Dynamic programming, naïve method and Divide and conquer methods can be used to solve the maximum sub array sum problem.