Question

How to implement a recursive Fibonacci sequence that returns the Nth number in Java

Answer 1

public class MyClass {
    public static long fibonacci(long n) {
        if (n == 0 || n == 1) {
          return n;
        }
        return fibonacci(n - 1) + fibonacci(n - 2);
    }
    
    public static void main(String args[]) {
        System.out.println(fibonacci(7)); // 1,1,2,3,6,9,13 -> 13
        
        System.out.println(fibonacci(9)); // 1,1,2,3,6,9,13,21,34 - > 34
    }
}
     
     
     
     
/*
run:
     
13
34
     
*/

 

70+ SQL courses for beginners and professionals