Further reading
MONOGRAPHS IN RECURSION
This book has provided a broad coverage of recursion, containing essential topics for designing recursive algorithms. However, the reader can find additional aspects, examples, and implementation details in other references. In particular, the following book:
- Jeffrey Soden Rohl. Recursion Via Pascal. Cambridge Computer Science Texts. Cambridge University Press, 1st edition, August 1984
contains numerous examples in Pascal of recursive algorithms on data structures (linked lists, trees, or graphs) implemented through pointers. In contrast, the current book avoids pointers since they are not used explicitly in Python. The suggested reference includes backtracking algorithms for generating additional ...
Get Introduction to Recursive Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
