// 计算斐波那契数列 function fibonacciRecursive(n) { if (n <= 1) return n; return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2); } function fibonacciIterative(n) { if (n <= 1) return n;