Question

Fibonacci Series Write a recursive function called fibor that computes the first n elements of the Fibonacci series where n is the sole input argument. You are not allowed to use loops. Here is the formal definition of the series: $\begin{cases} 1, & \text{if } n \le 2, n \in \mathbb{N},\\ F(n-2) + F(n-1), & \text{otherwise} \end{cases}$ F(n) = Here are the first few elements: 1, 1, 2, 3, 5, 8, 13, ... If the grader times out, your function might be making too many recursive calls. For example, if fibor(5) makes the calls fibor(4) and fibor(3), and fibor(4) also calls fibor(3), then you called fibor(3) twice unnecessarily. With larger inputs, this may blow up. In that case, you need to rethink your approach.

          Fibonacci Series
Write a recursive function called fibor that computes the first n elements of the Fibonacci series where n is the sole input argument. You are not allowed to use loops. Here is the
formal definition of the series:
$\begin{cases} 1, & \text{if } n \le 2, n \in \mathbb{N},\\ F(n-2) + F(n-1), & \text{otherwise} \end{cases}$
F(n) = 
Here are the first few elements: 1, 1, 2, 3, 5, 8, 13, ...
If the grader times out, your function might be making too many recursive calls. For example, if fibor(5) makes the calls fibor(4) and fibor(3), and fibor(4) also calls fibor(3), then
you called fibor(3) twice unnecessarily. With larger inputs, this may blow up. In that case, you need to rethink your approach.

Fibonacci Series
Write a recursive function called fibor that computes the first n elements of the Fibonacci series where n is the sole input argument. You are not allowed to use loops. Here is the
formal definition of the series:
1, if n ≤ 2, n ∈ℕ,
F(n-2) + F(n-1), otherwise
F(n) =
Here are the first few elements: 1, 1, 2, 3, 5, 8, 13, ...
If the grader times out, your function might be making too many recursive calls. For example, if fibor(5) makes the calls fibor(4) and fibor(3), and fibor(4) also calls fibor(3), then
you called fibor(3) twice unnecessarily. With larger inputs, this may blow up. In that case, you need to rethink your approach.

Added by Juan Jos- W.

Question

Please give Ace some feedback