Java递归调用

public class Factorial {
    public static long factorial(int n) {
        if (n == 0) { // 基本情况
            return 1;
        } else { // 递归步骤
            return n * factorial(n - 1);
        }
    }

    public static void main(String[] args) {
        int number = 5;
        System.out.println("Factorial of " + number + " is " + factorial(number));
    }
}

public class Fibonacci {
    public static int fibonacci(int n) {
        if (n <= 1) { // 基本情况
            return n;
        } else { // 递归步骤
            return fibonacci(n - 1) + fibonacci(n - 2);
        }
    }

    public static void main(String[] args) {
        int number = 10;
        System.out.println("Fibonacci number at position " + number + " is " + fibonacci(number));
    }
}