// fib_bench.js — 递归 fibonacci 性能测试
function fib(n) {
    if (n < 2) return n;
    return fib(n - 1) + fib(n - 2);
}
let t0 = Date.now();
let r = fib(35);
let t1 = Date.now();
console.log("node fib(35)=" + r + " time=" + (t1 - t0) + "ms");