#python #sicp
Recursive functions leverage the rules of evaluating call expressions to bind
names to values, often avoiding the nuisance of correctly assigning local names
during iteration. For this reason, recursive functions can be easier to define
correctly. However, learning to recognize the computational processes evolved by
recursive functions certainly requires practice.
If you want to change selection, open document below and click on "Move attachment"
1.7 Recursive Functions . The
state of the computation is entirely contained within the structure of the
environment, which has return values that take the role of total , and binds
n to different values in different frames rather than explicitly tracking
k .
<span>Recursive functions leverage the rules of evaluating call expressions to bind
names to values, often avoiding the nuisance of correctly assigning local names
during iteration. For this reason, recursive functions can be easier to define
correctly. However, learning to recognize the computational processes evolved by
recursive functions certainly requires practice.
1.7.2 Mutual Recursion
Video:
Show
Hide When a recursive procedure is divided among two functions that call each other,
the functions are said to be mutually recursive. As an Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details