Kadane's Algorithm in Go (GoLang).

kadane-algorithm.go

package array

func maxSubArraySum(a []int, size int) int {
    maxSoFar, currMax := a[0], a[0]

    for i := 1; i < size; i++ {
        currMax = max(a[i], currMax + a[i])
        maxSoFar = max(maxSoFar, currMax)
    }

    return maxSoFar
}