Write recursive Fibonacci function.
when entering n = 100, the recursion gets stuck.
so write a non-recursive Fibonacci function

Question

Write recursive Fibonacci function.
when entering n = 100, the recursion gets stuck. 
so write a non-recursive Fibonacci function

Anonymous · Accepted Answer

//Recursive
function fiboR(n){
  if(n<2)
    return n;
  return fiboR(n-1)+fiboR(n-2);
}

//Non-recursive
function fibo(n){
  if(!n)
    return 0;
  
  var num = 0;
  var curr = 0;
  for (var i = 0; i <= n; i++){
    var prev = curr;
    curr = num;
    if(i <= 2){
      num = 1;
    } else{
      num = prev + curr;
    }
  }
  
  return num;
}

MyHeritage

MyHeritage interview question

Interview Answer

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?