Minimum Subarray Problem

Minimum Subarray Problem.py

let A be the given array of integers
let minSum = infinity, minLeft = 0, minRight = 0, currentMin = 0, left = 0, right = 0
for i = 0 to A.length - 1
  currentMin += A[i]
  if currentMin < minSum 			
    minSum = currentMin 			
    right = i; 			
    minLeft = left 			
    minRight = right 		
  if currentMin > 0
    currentMin = 0
    left = i + 1
    right = i + 1
A[minLeft...minRight] is the minimum sum contiguous subarray.
return minSum