Maximum subarray problem

Find maximum subarray problem by using Kadane's algorithm

Maximum subarray problem
Description: This function will find Maximum subarray problem by using Kadane's algorithm.

Input: Array 'A'
Output:
'max_so_far' is a maximum value,
'B' is a subarray has 'max_so_far' value

Example: A = [7 4 -5 6 -4 2 3 -7] --> [max_so_far, B] = Kadane(A)
--> max_so_far = 13, B = [7 4 -5 6 -4 2 3]

Complexity: O(n)
-------------------------------------------------------------------------
Author: Trong Hoang Vo
Date: May 30, 2016
Contact: [e-mail] (my Gmail)
facebook.com/hoangtrong2305 (my Facebook)
-------------------------------------------------------------------------