fib - ms

[marshi23]

No description provided.

[shrutivanw]

Nice work on the algorithm.
I didn't see any comments on the time and space complexity. Take some time to practice deducing it and explaining the reasoning behind your answers.

Can you think of a way to tweak your algorithm so that the space complexity is improved? Hint: Do you really need to keep track of all of the fibonacci numbers in the array? Through each iteration in the loop, you only need the previous two fibonacci numbers. Could you save them in two integer variables and update them through each iteration of the loop? Give it some thought, then compare your solution with mine on https://github.com/Ada-C10/fibonacci/blob/solution/lib/fibonacci.rb