Solve the Fibonacci sequence algorithm in Javascript with me #Shorts

Solve the Fibonacci sequence algorithm in Javascript with me in this weeks #Shorts

[seths]

pretty cool...when i was in high school (90s), our teacher asked the class to write this in basic. I was the only one that could do it :)

[Grassmpl]

solution 3: solution 2 with DP memoization.
solution 4: use explicit formula. Work best if you can code an object to help with symbolic (rather the numeric) sqrt manipulation. Or we can just expand it using binomial theorem, but it will no longer be O(1).

[TiffInTech]

Like and comment if you want more shorts featuring going through algorithms!

[ohwow]

Please do this again with the use of memoization. That’s a very fast solution.

[explodingrubberducky]

Always looking forward to a Tiff Video!

[jcw]

Remember me when I resolved this problem in C++ for the first time. Love it

[nature_nd]

I'm curious, what is your take on the performance of the two solutions as you pick larger numbers in the sequence?

[xybersurfer]

ah yes, Fibonacci. it's nice to return to sometimes. your array will of course keep growing, but who cares right? there's always something i love about simplicity. you're beautiful Tiff :)

[PHNX_RSN]

I did the same thing in C# a week or so ago.

[The-Dev-Ninja]

In C++ if you put while, the program dont finish :)

WhileVariable = 1;

While (WhileVariable != 0)
{
//Fibonacci code
}

[javohirxusanov]

I think in the second solution returning n if n less than 2 is wrong since first and second fib # is 1 assuming fib # starts from 1

[yahya]

We usually dont get pretty girls in tech, lmao im so shocked ur like a frekin model and ur smart! Damn

[caionmarquezini]

make an rpc server that process fibonacci with threads and return the result with xmlrpc. :)