Day 6 – Fibonacci Series in JavaScript: Loop vs Recursion

 ๐Ÿ”ฅ JavaScript DSA Interview Series – Day 6


๐Ÿ’ก Topic: How to generate Fibonacci numbers in JavaScript using both loop and recursion.



---


✅ What is the Fibonacci Series?


The Fibonacci sequence is:


0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...


Each number is the sum of the previous two:


F(n) = F(n - 1) + F(n - 2)


๐Ÿ“Œ Base Conditions:

F(0) = 0, F(1) = 1



---


๐Ÿ” 1. Loop-Based Fibonacci Generator


function fibonacciLoop(n) {

  let fib = [0, 1];

  for (let i = 2; i < n; i++) {

    fib[i] = fib[i - 1] + fib[i - 2];

  }

  return fib.slice(0, n);

}

Comments

Popular posts from this blog

Day 4 – Palindrome Number in JavaScript Without Converting to String

Day 9 – Count Vowels in a String using JavaScript | DSA Challenge with Code & Explanation

Day 13: Find Missing Number in an Array – JavaScript DSA Challenge