CJCoding With Joseph
← Back to Question List
JavaScript Code Walkthrough #33

Building a Fibonacci Sequence

hardRecursion

📄 Code

Read carefully — what does this print?
1function fib(n) {
2 if (n < 2) return n;
3 return fib(n - 1) + fib(n - 2);
4}
5let out = [];
6for (let i = 0; i < 7; i++) {
7 out.push(fib(i));
8}
9console.log(out.join(" "));

🎯 Your Answer