/ Published in: C
Given an array of integers, find the sub-array with maximum sum.
Interesting test cases:
* Empty array.
* One positive element.
* One negative element.
* Two or more elements.
* All negative.
* All positive.
Interesting test cases:
* Empty array.
* One positive element.
* One negative element.
* Two or more elements.
* All negative.
* All positive.