Additions in computing Fibonacci numbers.
How many additions are performed when we compute the
th Fibonacci number using the definition of
based on the
procedure? Show that the number of additions would be exponentially greater if we had implemented
(lambda () <exp>)
, without using the optimization provided by the
procedure described in section 3.5.1.
There are no comments yet.
You must log in to post a comment.Login