Question: Here is a simple recursive function to compute the Fibonacci sequence: long fibr (int n) { // Recursive Fibonacci generator // fibr (46) is largest

Here is a simple recursive function to compute the Fibonacci sequence:

long fibr (int n) { // Recursive Fibonacci generator

// fibr (46) is largest value that fits in a long

Assert ( (n > 0) && (n

if ( (n == 1) || (n == 2) return 1; // Base cases

return fibr(n-1) + fibr(n-2); // Recursion

}

Here is a simple recursive function to compute the Fibonacci sequence:

Data Structures and Algorithm Analysis in C++ by Clifford Shaffer

This algorithm turns out to be very slow, calling Fibr a total of Fib(m) times. Contrast this with the following iterative algorithm: long fibi (int n) Iterative Fibonacci generator ert (46) is largest value that fits in a long (in 0) (n 47), Input out of range") long past prev, curr; store temporary values past prev curr 1; initialize for (int i 3 n; it Compute next value past. prev past holds fibi (i-2) prev curr prev holds fibi (i-1) curr Past previ curr now holds fibi (i) return curr Function Fibi executes the for loop m 2 times (a) Which version is easier to understand? Why? (b) Explain why Fibr is so much slower than Fibi

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Reimplement function fibr from Exercise 2.11, using a stack to replace the recursive call as described in Section 4.2 .4. Data from in Exercise 2.11 2.11 Here is a simple recursive function to...

Here is a simple recursive function to compute the Fibonacci sequence: /** Recursively generate and return the nth Fibonacci number */ static long fibr(int n) { // fibr(91) is the largest value that...

data structure & java recommend Q-5) (10 pt) Here is a simple recursive function to compute the Fibonacci sequence: // Recursive Fibonacci generator static long fibr(int n) { // fibr (91) is the...

Here is a simple recursive function to compute the Fibonacci sequence: This algorithm turns out to be very slow, calling Fibr a total of Fib(n) times. Contrast this with the following iterative...

he game of jump-It consists of a board with n positive integers in a row except for the first column, which always contains zero. These numbers represent the cost to enter each column. Here is a...

Reimplement the following function fibr in C using a stack to replace the recursive calls. long fibr(int n) (/Recursive fibonacci generator // fibr(46) is largest value that fits in a long Assert...

Reimplement the following function fibr in C++ using a stack to replace the recursive calls. code: long fibr(int n) { //Recursive fibonacci generator // fibr(46) is largest value that fits in a long...

Write and solve a recurrence relation to compute the number of times Fibr is called in the Fibr function of Exercise 2.11. Data From in Exercise 2.11. 2.11 Here is a simple recursive function to...

In this programming assignment, you will implement a Fibonacci function that avoids repetitive computation by computing the sequence linearly from the bottom up: F(0) through F(n). The calculation of...

Abstract In this programming assignment, you will implement a Fibonacci function that avoids repetitive computation by computing the sequence linearly from the bottom up: F(0) through F(n). The...

A soap bubble of radius r is inflated with an ideal gas. The atmospheric pressure is Po, the surface tension of the soap water solution is a. Find the difference between the molar heat capacity of...

How much income should the taxpayer recognize in each of the following situations? Explain. a. Julius owns a 25% interest in the Flyer Company, which is organized as a partnership. During the current...

5. Challenge: The LOOPNZ example in Section 6.4.2 relies on a sentinel value to handle the possibility that a positive value might not be found. What might happen if you removed the sentinel?

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

Go to the website of the Federal Reserve Bank of St. Louis (http://www.stlouisfed.org) to find some information about the Fed. Find a map of the Federal Reserve districts. If you live in the United...

Suppose that the T-account for First National Bank is as follows: Assets Liabilities Reserves $100,000 Deposits $500,000 Loans 400,000 a. If the Fed requires banks to hold 5 percent of deposits as...

Imagine that you intend to buy a portfolio of ten stocks with some of your savings. Should the stocks be of companies in the same industry? Should the stocks be of companies located in the same...