- there are 4 examples written about fibonacci series
- 2 worse, 2 better
the references are from UdemyCourse: LearningAlgorithmsInJavascriptFromScratch stackoverflow.com/questions/7944239/
Prove Upper Bound (Big O) for Fibonacci's Sequence?
The result is O(n) = 1.6^n
A beginner's guide to Big O notation
Big-O of Fibonacci with memoization?
tell when having cache (aka memorization) that the result would be O(n)
at ex4 instead of the O(2^n)
that template at ex1, ex2
if using Generator