Fibonacci numbers Program plan: Import required packages Declare the main class named “Main”. Give the main method “public static void main ()” Create an object “sc” for the scanner class. Get a number from the user and store it in a variable “index”. Print the output by calling the function “fib ()”. Give function definition for the static method “fib ()”. Declare the required variables “f0”, “f1”, and “currentFib” Check if the value is equal to zero. Return 0. Check if the value is equal to 1. Return 1. Loop n times starting from 2. Add the values “f0” and “f1” and store it in a variable “currentFib”. Assing “f1” to “f0”. Assign “currentFib” to “f1”. Return the value “f1”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 18.2PE

Program Plan Intro

Fibonacci numbers

Program plan:

Import required packages

Declare the main class named “Main”.

Give the main method “public static void main ()”

Create an object “sc” for the scanner class.

Get a number from the user and store it in a variable “index”.

Print the output by calling the function “fib ()”.

Give function definition for the static method “fib ()”.

Declare the required variables “f0”, “f1”, and “currentFib”

Check if the value is equal to zero.

Return 0.

Check if the value is equal to 1.

Return 1.

Loop n times starting from 2.

Add the values “f0” and “f1” and store it in a variable “currentFib”.

Assing “f1” to “f0”.

Assign “currentFib” to “f1”.

Return the value “f1”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Ex. 01 : Recursion About So far, we have learned that we can perform repetitive tasks using loops. However, another way is by creating methods that call themselves. This programming technique is called recursion and, a method that calls itself within it's own body is called a recursive method. One use of recursion is to perform repetitive tasks instead of using loops, since some problems seem to be solved more naturally with recursion than with loops. To solve a problem using recursion, it is broken down into sub-problems. Each sub-problem is similar to the original problem, but smaller in size. You can apply the same approach to each sub-problem to solve it recursively. All recursive methods use conditional tests to either 1. stop or 2. continue the recursion. Each recursive method has the following characteristics: 1. end/terminating case: One or more end cases to stop the recursion. 2. recursive case: reduces the problem in to smaller sub-problems, until it reaches (becomes) the end…

1. Write a recursive method expFive(n) to compute y=5^n. For instance, if n is 0, y is 1. If n is 3, then y is 125. If n is 4, then y is 625. The recursive method cannot have loops. Then write a testing program to call the recursive method. If you run your program, the results should look like this: > run RecExpTest Enter a number: 3 125 >run RecExpTest Enter a number: 3125 2. For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Once m is 0, the function returns n. Once n is 0, the function returns m. If neither is 0, the function can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n. Although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. Meaning your code needs to follow the given algorithm. Then…

9. Ackermann's Function Ackermann's function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a method ackermann (m, n), which solves Ackermann's function. Use the following logic in your method: If m = 0 then return n + 1 If n = 0 then return ackermann (m Otherwise, return ackermann(m 1, 1) 1, ackermann (m, n - 1))