- In Java Please 1 (18.23 KiB) Viewed 54 times
In java please
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
In java please
In java please
Q2. (15 marks) In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation F(n) = F(n-1) + F(n − 2).... (2.1) with seed values Fo= 0, F₁=1 Test Case: Write a function named fib(int n) that returns Fn. For example, if n = 0, then fib() should return 0. If n = 1, then it should return 1. For n > 1, it should return F₂−1+F₂-2-
Q2. (15 marks) In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation F(n) = F(n-1) + F(n − 2).... (2.1) with seed values Fo= 0, F₁=1 Test Case: Write a function named fib(int n) that returns Fn. For example, if n = 0, then fib() should return 0. If n = 1, then it should return 1. For n > 1, it should return F₂−1+F₂-2-