In [12]:

    

from sys import maxsize

def findMaxSubarrayBruteForce(arr):
    maxSoFar, maxStart, maxEnd = -sys.maxsize - 1, 0, 0
    for i in range(len(arr)-1):
        for j in range(i+1, len(arr)):
            diff = arr[j] - arr[i]
            if diff > maxSoFar:
                maxSoFar = diff
                maxStart = i
                maxEnd = j
    return (maxSoFar, maxStart, maxEnd)


    

In [13]:

    

findMaxSubarrayBruteForce([100, 113, 110, 85, 105, 102, 86, 63, 81, 101, 94, 106, 101, 79])


    

    
Out[13]:





(43, 7, 11)

In [ ]: