When a recursive procedure is divided among two functions that call each other,
the functions are said to be [...].
Answer
mutually recursive
Tags
#python #sicp
Question
When a recursive procedure is divided among two functions that call each other,
the functions are said to be [...].
Answer
?
Tags
#python #sicp
Question
When a recursive procedure is divided among two functions that call each other,
the functions are said to be [...].
Answer
mutually recursive
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it When a recursive procedure is divided among two functions that call each other,
the functions are said to be mutually recursive.
Original toplevel document
1.7 Recursive Functions 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 <span>When a recursive procedure is divided among two functions that call each other,
the functions are said to be mutually recursive. As an example, consider the
following definition of even and odd for non-negative integers:
a number is even if it is one more than an odd number a number is odd if it is one more tha
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.