Kadane's algorithm to find max subarray

kadanes.go

package main

import "fmt"

func kadanes(d []int) int {
	var lm, gm int
	var init bool

	for _, n := range d {
		lm = max(n, n+lm)
		if !init || lm > gm {
			gm = lm
			init = true
		}
	}

	return gm
}

func max(a, b int) int {
	if a > b {
		return a
	}

	return b
}

func main() {
	fmt.Println(kadanes([]int{-2, 1, -3, 4, -1, 2, 1, -5, 4}))
}