1. The Fibonacci sequence a(1), a(2), a(3),..., a(n), .... is defined by a(1) = 1 a(2)...

Transcribed Image Text:

1. The Fibonacci sequence a(1), a(2), a(3),..., a(n), .... is defined by a(1) = 1 a(2) = 1 a(n)= a(n-1)+ a(n-2), for all n > 2. This generates the sequence 1, 1,2,3,5,8, 13, 21, ... Write a C++ function "fibonacci(...)" that computes the Fibonacci number corresponding to its positive integer argument, so that, for example, fibonacci (7) 13. 1. The Fibonacci sequence a(1), a(2), a(3),..., a(n), .... is defined by a(1) = 1 a(2) = 1 a(n)= a(n-1)+ a(n-2), for all n > 2. This generates the sequence 1, 1,2,3,5,8, 13, 21, ... Write a C++ function "fibonacci(...)" that computes the Fibonacci number corresponding to its positive integer argument, so that, for example, fibonacci (7) 13.

Answer rating: 100% (QA)

C include using namespace std int fibonacciint n if n n cout The n th Fibonacci number is fibonaccin endl return 0 Example output Enter the Fibonacci ... View the full answer