it is often clearer to think about recursive calls as [a kind of abstraction].
Answer
functional abstractions
Tags
#python #sicp
Question
it is often clearer to think about recursive calls as [a kind of abstraction].
Answer
?
Tags
#python #sicp
Question
it is often clearer to think about recursive calls as [a kind of abstraction].
Answer
functional abstractions
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it it is often
clearer to think about recursive calls as functional abstractions.
Original toplevel document
1.7 Recursive Functions the standard
definition of the mathematical function for factorial:
(n−1)!n!n!=(n−1)⋅(n−2)⋅⋯⋅1=n⋅(n−1)⋅(n−2)⋅⋯⋅1=n⋅(n−1)!(n−1)!=(n−1)⋅(n−2)⋅⋯⋅1n!=n⋅(n−1)⋅(n−2)⋅⋯⋅1n!=n⋅(n−1)! While we can unwind the recursion using our model of computation, <span>it is often
clearer to think about recursive calls as functional abstractions. That is, we
should not care about how fact(n-1) is implemented in the body of fact ;
we should simply trust that it computes the factorial of n-1 . Treating a
recursive call as a
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.