Fibanocci with the Golden Ratio

fib.js

var phi = (1 + Math.sqrt(5)) / 2;

var fib_gr = function (n) {
    return Math.floor((Math.pow(phi, n) / Math.sqrt(5)) + (1 / 2));
};

for (var i = 1; i < 20; ++i) {
    console.log(i, '->', fib_gr(i));
}

var fib_recursion = function (n) {
  if (n === 0 || n === 1) {
    return n;
  }
  return fib_recursion(n-1) + fib_recursion(n-2);
};

for (var i = 1; i < 20; ++i) {
    console.log(i, '->', fib_recursion(i));
}