Fibonacci series implementation using dynamic programming technique in Golang

fibonacci_series_dynamic_programming.go

package main

import "fmt"

var cache = make(map[int]int)
var dCounter int

func fibDyn(n int) int {
	dCounter++
	if _, ok := cache[n]; !ok {
		result := fibDyn(n-1) + fibDyn(n-2)
		cache[n] = result
	}
	return cache[n]
}

func main() {
	cache[1] = 0
	cache[2] = 1
	fmt.Println(fibDyn(16))
	fmt.Println("Called function", dCounter, "times")
}