Function CutRodRec

dynamic/rodcutting.go:10–20

CutRodRec solve the problem recursively: initial approach

(price []int, length int)

// CutRodRec solve the problem recursively: initial approach
func CutRodRec(price []int, length int) int {
	if length == 0 {
		return 0
	}

	q := -1
	for i := 1; i <= length; i++ {
		q = Max(q, price[i]+CutRodRec(price, length-i))
	}
	return q
}

// CutRodDp solve the same problem using dynamic programming
func CutRodDp(price []int, length int) int {