When a recursive procedure is divided among two functions that call each other,
the functions are said to be mutually recursive.
If you want to change selection, open document below and click on "Move attachment"
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
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
|status||not read|| ||reprioritisations|
|last reprioritisation on|| ||suggested re-reading day|
|started reading on|| ||finished reading on|