Question

Write the code in java programming language

To get some practice with recursion.

You can do all this in one driver program.

Write a recursive method to compute the result of the Fibonacci sequence:

Fibonacci(N) = Fibonacci(N -1) + Fibonacci(N-2)

N == 0 is 0

N == 1 is 1

Testing: Display the result for Fibonacci(N) and the number of function calls for N = 2, 5 and 10.

Answer 1

// Importing for Scanner Class

import java.util.*;

public class Main

{

// Function computing the Result of the Fibonacci sequence

static int Fibonacci(int N)

{

// In case N = 0 or N = 1 it returns the same N otherwise compute

// Computation done by adding the previous two terms

if (N>1)

{

return(Fibonacci(N-1)+Fibonacci(N-2));

}

else

{

return N;

}

}

public static void main(String[] args)

{

// Object Instantiation of scanner class

Scanner s = new Scanner(System.in);

System.out.print("Enter the number:");

// User entering the number for Computation

int a = s.nextInt();

System.out.println("Result of the Fibonacci sequence:");

// Printing the computation result

System.out.println(Fibonacci(a));

System.out.println("Number of function calls of Fibonacci sequence:");

// Printing the number of calls required using the generic term

System.out.print(2*Fibonacci(a)-1);

}

}

Code snapshot:-

// Importing for Scanner Class import java.util.*; public class Main // Function computing the Result of the Fibonacci sequence static int Fibonacci(int N) // In case N = or N = 1 it returns the same N otherwise compute // Computation done by adding the previous two terms if (N>1) return(Fibonacci(N-1)+Fibonacci(N-2)); else return N;

public static void main(String[] args) // Object Instantiation of scanner class Scanner s = new Scanner(System.in); System.out.print("Enter the number:"); // User entering the number for Computation int a = s.nextInt(); System.out.println("Result of the Fibonacci sequence:"); // Printing the computation result System.out.println(Fibonacci(a)); System.out.println("Number of function calls of Fibonacci sequence:"); // Printing the number of calls required using the generic term System.out.print(2*Fibonacci(a)-1);

Output snapshot:-

Enter the number:2 Result of the Fibonacci sequence: Number of function calls of Fibonacci sequence:

Enter the number:5 Result of the Fibonacci sequence: Number of function calls of Fibonacci sequence:

Enter the number:10 Result of the Fibonacci sequence: Number of function calls of Fibonacci sequence: 109