Reference no: EM13694828

Question: The Fibonacci sequence is a series of integers

0,1,1,2,3,5,8,13,21,34,55,89,......

See the pattern?

Each element in the series is the sum of preceding two elements. Here is the recursive formula for calculating nth number of sequence:

 

                                                                 {N,                                      if N= 0 or 1           

                                          Fib(N)=         {Fib(N-2)+Fib(N-1),         if N>1

 

Problem: 1) Write a recursive method Fibonacci that returns the nth Fibonacci number when passed the argument n.

Problem: 2) Write a non-recursive version of the method Fibonacci.

Problem: 3) Write a driver to test your two versions of the method Fibonacci.

Problem: 4) Compare the recursive and iterative versions for efficiency.(Use words, not Big-O notation.)

Add comments in code section. Code this program in java programming - Describe each and every problem in depth.