Recursion: Fibonacci Numbers

  • + 0 comments

    java 8 solution

     public static int fibonacci(int n) {
    
           if (n <= 1) {
                return n;
            }
            return fibonacci(n - 1) + fibonacci(n - 2);
        
            // Complete the function.
        }