Create 08_LargestSumContiguousSubarray.cs

08. Write a program that finds the sequence of maximal sum in given array.
    Example:	{2, 3, -6, -1, 2, -1, 6, 4, -8, 8} -> {2, -1, 6, 4}
Can you do it with only one loop (with single scan through the elements of the array)?
 
Solved with the help of Kadane’s Algorithm - http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/