Design Using Recursion
After reading this chapter, you should understand:
- The design of recursive algorithms
- Execution trace and its use in understanding control flow of programs
- How to express the execution trace using regular expressions
- Iterative and recursive functions
- The Ackermann’s function
To define recursion, we must first define recursion.
To iterate is human; to recurse, divine.
We are already familiar with recursive algorithms and their implementation. It is ...