Go Golang - recursive function, fibonacci sequence

Go Golang - recursive function, fibonacci sequence

package main
 
import "fmt"
 
func fib(n uint) uint {
    if n == 0 {
        return 0
    } else if n == 1 {
		return 1
	} else {
		return fib(n-1) + fib(n-2)
	}
}

func main() {
	n := uint(10)
	fmt.Println(fib(n))
}

package main

func fib(n int) int {
	// 0 1 1 2 3 5 8 13 21
	f := make([]int, n+1)
	f[0] = 0
	if n > 0 {
		f[1] = 1
		for i := 2; i <= n; i++ {
			f[i] = f[i-1] + f[i-2]
		}
	}

	return f[n]
}

func main() {
	print(fib(100))
}

package main

import "fmt"

func main() {
	var num1 int
	fmt.Scan(&num1)

	fmt.Println(fibonacci(num1))
}

func fibonacci(n int) int {
	fib := make([]int, n+1)
	fib[0], fib[1] = 0, 1
	for i := 2; i <= n; i++ {
		fib[i] = fib[i-1] + fib[i-2]
	}
	return fib[n]
}```