What is the time complexity of the naive method used to find the maximum sub-array sum in an array containing n elements?

What is the time complexity of the naive method used to find the maxim

1.	What is the time complexity of the naive method used to find the maximum sub-array sum in an array containing n elements?
A.	O(n<sup>2</sup>)
B.	O(n)
C.	O(n<sup>3</sup>)
D.	O(1)
Answer» C. O(n<sup>3</sup>)