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?
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
Dynamic programming, naïve method and Divide and conquer methods can be used to solve the maximum sub array sum problem.
মোঃ আরিফুল ইসলাম
Feb 20, 2025