calculate_recursion.go

func calculate(input ...int, method string) int {
  var result int
  if method == "fibonacci" {
    result = fibRec(input[0])
  }
  return result
}

func fibRec(n int) int {
  if n <= 1 {
		return n
	} else {
		return fibRec(n-1) + fibRec(n-2)
	}
}
}

func fibNonRec(n int) int {
  if n <= 1 {
		return n
	}
	var fib = 1
	var fibPrev = 1
	for i := 2; i < n; i++ {
		var temp int
		temp = fib
		fib = fib + fibPrev
		fibPrev = temp
	}
	return fib
}