JavaScript JS Fibonacci querie

[andrzej1234]

Hi, can anyone explain why and how the number '2' is not skipped in the fib sequence?

const fib = [0,1];

for(let i=0; i < 18; i++) {

let nextfib = fib + fib[i +1]
fib.push(nextfib);
}

console.log(fib);

When I'm trying to figure out the steps I'm missing number 2 in the fib sequence

 

[andrzej1234]

.

 

[Antero360]

Hi, can anyone explain why and how the number '2' is not skipped in the fib sequence?

const fib = [0,1];

for(let i=0; i < 18; i++) {

let nextfib = fib + fib[i +1]
fib.push(nextfib);
}

console.log(fib);

When I'm trying to figure out the steps I'm missing number 2 in the fib sequence

Hi there,
you are not grabbing the previous value, you are just adding to the array itself.
try this

 

[Velpus Captiosus]

Hi!Have a good day!I dont know anything about JS but algorithms such as the Fibonacci sequence which have a very obvious base case and a recursion step are much easier to be written down as a recursive function.

 

[Antero360]

Hi!Have a good day!I dont know anything about JS but algorithms such as the Fibonacci sequence which have a very obvious base case and a recursion step are much easier to be written down as a recursive function.

Hi there,
Could you provide some sort of guide for the user to follow if they wish to go down that path?

 

[Velpus Captiosus]

Hi there,
Could you provide some sort of guide for the user to follow if they wish to go down that path?

I will write my code in C and wish that the OP understands C:

int fibonnaci(int n)
{
   
  
    if(n==0)
    {
       printf("0 : 0");

        return 0;
      
        //first base case//
    }
    else if(n==1)
    {
        printf("1 : 1");

        return 1;
      
        //second base case//
    }
    else
    {
        int y = fibonacci(n-1)+fibonacci(n-2);
      
        // recursion step //
      
        printf("%d : %d",n,y);
      
        return y;
    }
  
  
  
  
}