Exercise: Tuning
Compare the performance of three versions of Fibonacci
straightforward recursive version
dynamic programming with "full" caching
dynamic programming, caching last two results
![[prev]](icon/prev.gif){kind=icon}
![[index]](icon/up.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}