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?

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

Dynamic programming

TuteeHUB · Answer

Two for loops (naive method)

TuteeHUB · Answer

Divide and conquer

TuteeHUB · Answer

Divide and conquerd) Dynamic programming, naïve method and Divide and conquer methods

1.	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.	Divide and conquerd) Dynamic programming, naïve method and Divide and conquer methods
Answer» E.

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?

Discussion

No Comment Found

Related MCQs

Reply to Comment