Function Recursive

math/fibonacci/fibonacci.go:53–59

Recursive calculates the n-th fibonacci number recursively by adding the previous two Fibonacci numbers. This algorithm is extremely slow for bigger numbers, but provides a simpler implementation.

(n uint)

// Recursive calculates the n-th fibonacci number recursively by adding the previous two Fibonacci numbers.
// This algorithm is extremely slow for bigger numbers, but provides a simpler implementation.
func Recursive(n uint) uint {
	if n <= 1 {
		return n
	}

	return Recursive(n-1) + Recursive(n-2)
}