11

When I had to implement fibunacci recursively at university, wrote an iterative algorithm instead and impressed everyone with my insane performance.

Comments
  • 1
    memoization? ;)
  • 0
    As Fibonacci is a linear recurrence can be solved to a single formula with a complexity of O(1) so I just took it from Wikipedia and it's done xd
Add Comment