#python #sicp
A function with multiple recursive calls is said to be tree recursive because
each call branches into multiple smaller calls, each of which branches into
yet smaller calls, just as the branches of a tree become smaller but more
numerous as they extend from the trunk.
If you want to change selection, open document below and click on "Move attachment"
1.7 Recursive Functions Global
This recursive definition is tremendously appealing relative to our previous
attempts: it exactly mirrors the familiar definition of Fibonacci numbers.
<span>A function with multiple recursive calls is said to be tree recursive because
each call branches into multiple smaller calls, each of which branches into
yet smaller calls, just as the branches of a tree become smaller but more
numerous as they extend from the trunk.
We were already able to define a function to compute Fibonacci numbers without
tree recursion. In fact, our previous attempts were more efficient, a topic
discussed later in the text. Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details