Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions src/.gitignore
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
*.aux
*.cp*
*.fn
*.fls
*.ky
*.log
*.pg
Expand Down
14 changes: 13 additions & 1 deletion src/sicp.texi
Original file line number Diff line number Diff line change
Expand Up @@ -3250,6 +3250,17 @@ linearly with the input. See @ref{Exercise 3.27}.}
@quotation
@strong{@anchor{Exercise 1.11}Exercise 1.11:} A function @math{f} is defined by
the rule that
@ifinfo

@example
/
| n if n < 3
f(n) = < f(n-1) + 2f(n-2) + 3f(n-3) if n >= 3
|
\
@end example

@end ifinfo
@tex
$$
f(n) =
Expand Down Expand Up @@ -24444,8 +24455,9 @@ count
@code{actual-value} rather than @code{eval} to evaluate the operator before
passing it to @code{apply}, in order to force the value of the operator. Give
an example that demonstrates the need for this forcing.
@end quotation

@noindent
@quotation
@strong{@anchor{Exercise 4.29}Exercise 4.29:} Exhibit a program that you would
expect to run much more slowly without memoization than with memoization.
Also, consider the following interaction, where the @code{id} procedure is
Expand Down