We can think of a tree-recursive function as [exploring what?].
Answer
exploring different possibilities
Tags
#python #sicp
Question
We can think of a tree-recursive function as [exploring what?].
Answer
?
Tags
#python #sicp
Question
We can think of a tree-recursive function as [exploring what?].
Answer
exploring different possibilities
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it We can think of a tree-recursive function as exploring different possibilities.
Original toplevel document
1.7 Recursive Functions -m, m) + count_partitions(n, m-1)
>>> count_partitions(6, 4)
9
>>> count_partitions(5, 5)
7
>>> count_partitions(10, 10)
42
>>> count_partitions(15, 15)
176
>>> count_partitions(20, 20)
627
<span>We can think of a tree-recursive function as exploring different possibilities.
In this case, we explore the possibility that we use a part of size m and
the possibility that we do not. The first and second recursive calls correspond
to these possibilities.
Im
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.