javascript/school/fibonacci.js · 957 字节 · 下载原文
// 斐波那契数列 —— 经典递归练习(前 15 项,另附一个迭代版求值)
// Fibonacci sequence -- the classic recursion exercise (first 15 terms, plus an iterative value)
//
// 来源 / Source: Rosetta Code「Fibonacci sequence」JavaScript 条目(GFDL 1.2 / CC-BY-SA 3.0)
// https://rosettacode.org/wiki/Fibonacci_sequence
// 改编 / Adapted: 输出由 console.log 改为本平台的 println_int。
// Output changed from console.log to this platform's println_int.
// 递归版(原始定义)
// Recursive form (the original definition)
function fib(n) {
if (n < 2) { return n; }
return fib(n - 1) + fib(n - 2);
}
// 迭代版
// Iterative form
function fibIter(n) {
var a = 0;
var b = 1;
var i = 0;
while (i < n) {
var t = a + b;
a = b;
b = t;
i = i + 1;
}
return a;
}
for (var k = 0; k < 15; k++) {
println_int(fib(k));
}
println_int(fibIter(30));