Kadane's Algorithm

Find the sum of the contiguous subarray within a one-dimensional array of numbers which has the largest sum..

Example Arrays:
{ -2, -3, 4, -1, -2, 1, 5, -3 };
{ 1, 3, 5, 7, -2, -6, 9, 4, 3, -8, 16 };
{ 5, 1, -7, 3, 7 };

---

Enter your array values as a comma-delimited string, ie.,: 5, 1, -7, 3, 7