Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Write a program which by given array of integer values (containing negative integers) finds the maximum sum of successive elements in the array.
Example:
2, 3, -6, -1, 2, -1, 6, 4, -8, 8
Gives
11
I am searching for a solution which is faster than O(N^2).
I think Kadane’s Algorithm is what you want