Given an array of arbitrary integers of length n, we want to determine the maximum sum of a contiguous sequence of numbers within the array. For example, in the array 5 -7 5 6 -1 2 -10 2
Answer is 12: 5 + 6 - 1 + 2
For an array that is already known to contain only positive integers, provide a linear time algorithm for answering this question and state its complexity.