Java函数的优势：性能、效率、稳定性

public class FibonacciCalculator {

    // 计算斐波那契数列的传统递归算法
    public static int recursiveFibonacci(int n) {
        if (n <= 1) {
            return n;
        }
        return recursiveFibonacci(n - 1) + recursiveFibonacci(n - 2);
    }

    // 计算斐波那契数列的循环算法
    public static int iterativeFibonacci(int n) {
        int[] fibSequence = new int[n + 1];
        fibSequence[0] = 0;
        fibSequence[1] = 1;
        for (int i = 2; i <= n; i++) {
            fibSequence[i] = fibSequence[i - 1] + fibSequence[i - 2];
        }
        return fibSequence[n];
    }

    public static void main(String[] args) {
        long startTime = System.nanoTime();
        System.out.println(recursiveFibonacci(40));
        long endTime = System.nanoTime();
        System.out.println("递归算法运行时间：" + (endTime - startTime) + " 毫秒");

        startTime = System.nanoTime();
        System.out.println(iterativeFibonacci(40));
        endTime = System.nanoTime();
        System.out.println("循环算法运行时间：" + (endTime - startTime) + " 毫秒");
    }
}