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.

—Author unknown

To iterate is human; to recurse, divine.

—Author unknown

Chapter Outline

8.1  Introduction

We are already familiar with recursive algorithms and their implementation. It is ...

Get Design and analysis of Algorithms, 2nd Edition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.