In [3]:

    

def findMaximumSubarray(a):
    maxSum = 0
    loIndex = -1
    hiIndex = -1
    
    for i in range(0, len(a) - 1):
        maxSoFar = 0
        for j in range(i, len(a) - 1):
            maxSoFar = maxSoFar + a[j]
            if maxSoFar > maxSum:
                maxSum = maxSoFar
                loIndex = i
                hiIndex = j
    
    return (maxSum, loIndex, hiIndex)


    

In [6]:

    

a = [13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5, -22, 15, -4, 7]
b = [1, -4, 3, -4]
findMaximumSubarray(b)


    

    
Out[6]:





(3, 2, 2)

In [ ]: