Question

In Java:

The Fibonacci sequence is a series of numbers beginning with 0 and 1, in which each succeeding number is the sum of the previous two.     0, 1, 1, 2, 3, 5, 8, 13, 21, ….

Practice your knowledge of recursion by producing a program that prints the nth Fibonacci number. That is, the program should accept an integer (n) as input and output the number that is the nth number in the Fibonacci sequence. For example, if n is 5, your output should be 3, because 3 is the fifth number in the Fibonacci sequence.

To get credit, your code must

• be free from compile-time or runtime errors, and
• work properly to find the correct number;
• your code must recursively call methods and may not use nested for loops of any kind.

Answer 1

import java.util.*;
public class Chegg
{
   static int fib(int n)
{
// if n==0 return 0
       if (n == 0)
return 0;
// if n==0 return 0
       if (n == 1)
           return 1;
       //return the sum of last two terms
return fib(n - 1) + fib(n - 2);
}
  
   public static void main(String[] args) {
   // taking user input
   Scanner scan= new Scanner(System.in);
   System.out.println("Enter number");
   int n=scan.nextInt();
   // here we are passing the index at whhich we require the fibonacci number
   System.out.println(fib(n-1));

   }
}