Chapter 13, Problem 9RE

Explanation of Solution

Program code:

The below snippet of code is used find the number of times the method “fib()” is called for finding the Fibonacci numbers up to of “n” numbers.

//import the required packages

import java.util.Scanner;

//define a class FibTester

public class FibTester

{

//declare a counter fibCount

private static int fibCount;

//define main method

public static void main(String[] args)

{

//define the object of Scanner

Scanner in = new Scanner(System.in);

//prompt the user to enter the number

System.out.print("Enter n: ");

//scan for the value of n

int n = in.nextInt();

//iterate a forloop

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

{

//assign 0 to fibCount

fibCount = 0;

//call the method fib

long f = fib(i);

//print the value of f

System.out.println("fib(" + i + ") = " + f);

//print the number of times fib() called

System.out.println("number of times fib(n) is called = " + fibCount);

}

}

//define a method fib()

public static long fib(int n)

{

//increment the value of fibCount

fibCount++;

//if the number is less than or equal to 2

if (n <= 2)

{

//return 1

return 1;

}

//if the number is greater than 2

else

{

//call the method fib() recursively and return the value

return fib(n - 1) + fib(n - 2);

}

}

}

Explanation:

The above program code is used to count the number of times the method “fib()” is executed...