Fibonacci Series in JavaScript

Fibonacci Series in JavaScript Without using recursion

function printFib(count) {
  var n1 = 0; // first char is 0 of fibonacci series
  var n2 = 1; // seconds char is also fixed '1'

  var output = "";

  output = n1 + " " + n2;
  // loop start from 2 because we know the first and second chars
  for (var i = 2; i < count; i++) {
    var n3 = n2 + n1; // sum of previous two element
    output += " " + n3;
    n1 = n2;
    n2 = n3;

  }
  console.log(output);
}

printFib(10);

Fibonacci Series in JavaScript with recursion

var n1 = 0; // first char is 0 of fibonacci series
var n2 = 1; // seconds char is also fixed '1'

var output = "";
output = n1 + " " + n2;
function printFib1(count) {

  if (count > 2) {
    var n3 = n2 + n1; // sum of previous two element
    output += " " + n3;
    n1 = n2;
    n2 = n3;
    printFib1(count -1);
  }

 
}

printFib1(10);
console.log(output);