Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction to recursion
- 2 Recursion with linked-linear lists
- 3 Recursion with binary trees
- 4 Binary recursion without trees
- 5 Double recursion, mutual recursion, recursive calls
- 6 Recursion with n-ary trees and graphs
- 7 Simulating nested loops
- 8 The elimination of recursion
- Further reading and references
- Index of procedures
- Frontmatter
- Contents
- Preface
- 1 Introduction to recursion
- 2 Recursion with linked-linear lists
- 3 Recursion with binary trees
- 4 Binary recursion without trees
- 5 Double recursion, mutual recursion, recursive calls
- 6 Recursion with n-ary trees and graphs
- 7 Simulating nested loops
- 8 The elimination of recursion
- Further reading and references
- Index of procedures
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781139171793/resource/name/firstPage-9781139171793ind_p192-192_CBO.jpg)
- Type
- Chapter
- Information
- Recursion via Pascal , pp. 192Publisher: Cambridge University PressPrint publication year: 1984