Subject Data Structures Implement and run the linear recursi

Subject: Data Structures

Implement and run the linear recursive method to calculate Fibonacci (5). Implement a similar solution to calculate F(n)=F(n-1)+F(n-2)+F(n-3) and F(0)=F(1)=F(2)=1.

Note: we implement methods in Java

Solution

recursive method to calculate Fibonacci (5) F(0)=F(1)=F(2)=1.

public class Fibonnaci {
public static int fibonacci(int n)
{
  
if(n == 0||n == 1||n == 2)
return 1;
  
else
return fibonacci(n - 1) + fibonacci(n - 2); F(n)=F(n-1)+F(n-2)
}

public static void main (String args[])
{
System.out.println(fibonacci(5));

}
  
}

(MODIFIED) Code to calculate F(n)=F(n-1)+F(n-2)+F(n-3)

public class Fibonnaci {
public static int fibonacci(int n)
{
  
if(n == 0||n == 1||n == 2)
return 1;
  
else
return fibonacci(n - 1) + fibonacci(n - 2)+fibonacci(n - 3); // F(n)=F(n-1)+F(n-2)+F(n-3)
}

public static void main (String args[])
{
System.out.println(fibonacci(5));

}
}