Compute Nth Fibonacci number (Using Recursion) - Method 1 - JAVA

Method 1 : Using Recursion
F0 = 0
F1 = 1
F2 = 1
F3 = F3-1 + F3-2 = F2 + F1 = 1+1 = 2

Fn = Fn-1 + Fn-2

public class Nth_Fibonacci_Number_20{

public static int Fibonacci(int n){

if(n <= 1)

return n;

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

}

public static void main(String[] args){

int n = 9;

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

}

}