Write a non-recursive version of the process fibonacci

Assignment Help Computer Engineering

Reference no: EM133085

Question

The Fibonacci sequence is series of integers.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89

observe the pattern? Each element in the series is the sum of preceding 2 elements. Here is a recursive method for calculating the nth number of the sequence-

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

a. write down a recursive method Fibonacci that returns the nth Fibonacci number when passed the argument n.

b. write down a non-recursive version of the process Fibonacci.

c. write down a driver to test your 2 version of the method Fibonacci.

d. evaluate the recursive and iterative version for efficiency.

Reference no: EM133085

Questions Cloud

How to generate a hub-and-spoke network : How to generate a hub-and-spoke network

What is steady-state cpi : What is steady-state CPI

Write down a program on visual basic format : Write down a program on visual basic format

Design a chart that showing input, output, and processing : Design a chart that showing input, output, and processing

Write a non-recursive version of the process fibonacci : Write a non-recursive version of the process Fibonacci

Write down the definitions for a double-stack structure : Write down the definitions for a double-stack structure

Discuss and describe the potential security threats : Discuss and describe the potential security threats

Discuss the relevance of the term social citizenship : Discuss the challenges to sustainability of pensions in Mauritius and what can be done to address the challenges Discuss the relevance of the term social citizenship to the provision of welfare state

Identify the security provisions : Identify the security provisions

User Account

All Pages