Problem

Rewrite the fib method in Listing 18.2 using iterations. Hint: To compute fib(n) without r...

Rewrite the fib method in Listing 18.2 using iterations. Hint: To compute fib(n) without recursion, you need to obtain fib(n - 2) and fib(n - 1) first. Let f0 and f1 denote the two previous Fibonacci numbers. The current Fibonacci number would then be f0 + f1. The algorithm can be described as follows:

Listing

f0 = 0; // For fib(0)

f1 = 1; // For fib(1)

for (int i = 1; i <= n; i++) {

currentFib = f0 + f1;

f0 = f1;

f1 = currentFib;

}

// After the loop, currentFib is fib(n)

Write a test program that prompts the user to enter an index and displays its Fibonacci number.

Step-by-Step Solution

Request Professional Solution

Request Solution!

We need at least 10 more requests to produce the solution.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)

All students who have requested the solution will be notified once they are available.

Add your Solution

Textbook Solutions and Answers Search

Solutions For Problems in Chapter 18

Free Homework Help App

Download From Google Play

Scan Your Homework
to Get Instant Free Answers

Need Online Homework Help?

Ask a Question

Get Answers For Free
Most questions answered within 3 hours.

Recent Solutions