fib algorithm

gistfile1.txt

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

console.log(fib(3));

function fib (a, b, n) {
  if (n==0) {
    return a;
  } else {
    return fib(b, a+b, n-1);
  }
}

console.log(fib(1,1,3));

function fib (n) {
  var a=1
    , b=1;
  n -= 1;
  while (n>0) {
    var temp = a;
    a = a+b;
    b = temp;
    n -= 1;
  }
  return a;
}

console.log(fib(3));