Find the maximum sub-array sum for the given elements. – McqOptions

MCQOPTIONS

1.	Find the maximum sub-array sum for the given elements.
A.
B.	3
C.	5
Answer» C. 5

Discussion

No Comment Found

Related MCQs

6?$
What is the time complexity of the naive method used to find the maximum sub-array sum in an array containing n elements?
Find the maximum sub-array sum for the given elements.
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?