What do you think?
Rate this book
Thinking Recursively
The process of solving large problems by breaking them down into smaller, more simple problems that have identical forms. Thinking Recursively: A small text to solve large problems. Concentrating on the practical value of recursion. this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science. Key Features:
Concentration on the practical value of recursion. Eleven chapters emphasizing recursion as a unified concept. Extensive discussion of the mathematical concepts which help the students to develop an appropriate conceptual model. Large number of imaginative examples with solutions. Large sets of exercises.
This is the 1980s original, with examples in Pascal. A 2000s version, using Java, is listed as a separate book.
Concentration on the practical value of recursion. Eleven chapters emphasizing recursion as a unified concept. Extensive discussion of the mathematical concepts which help the students to develop an appropriate conceptual model. Large number of imaginative examples with solutions. Large sets of exercises.
This is the 1980s original, with examples in Pascal. A 2000s version, using Java, is listed as a separate book.
192 pages, Paperback
First published January 1, 1986
11 people are currently reading
122 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 4 of 4 reviews
November 27, 2018
2018-11-27 have to return to the library
Useful, and also very kind introduction to recursion! Recommended by Mehran. Written by an educator who is trying to make recursion accessible from a number of angles:
What is recursion at a high level? Can we make it visual and accessible? How does it relate to mathematical induction? What are some basic recursive functions based on mathematical constructs students might already understand (factorial, Fibonacci)? What are some more complex recursive functions that really show the power of the recursive "leap of faith" (Hanoi)? What are some more complex recursive functions that show the utility of recursion (sorting, searching)? What are some clever algorithms people have developed using recursion (backtracking, lookahead)? How can this be used for other unexpected applications, like graphics? What data structures are particularly amenable to navigation by recursion (linked lists, trees)? And how is recursion implemented at a deeper mechanistic level (simulating the stack)?
Useful, and also very kind introduction to recursion! Recommended by Mehran. Written by an educator who is trying to make recursion accessible from a number of angles:
What is recursion at a high level? Can we make it visual and accessible? How does it relate to mathematical induction? What are some basic recursive functions based on mathematical constructs students might already understand (factorial, Fibonacci)? What are some more complex recursive functions that really show the power of the recursive "leap of faith" (Hanoi)? What are some more complex recursive functions that show the utility of recursion (sorting, searching)? What are some clever algorithms people have developed using recursion (backtracking, lookahead)? How can this be used for other unexpected applications, like graphics? What data structures are particularly amenable to navigation by recursion (linked lists, trees)? And how is recursion implemented at a deeper mechanistic level (simulating the stack)?
December 23, 2021
This book is for beginners. For an experienced programmer, one can quickly go through all the chapters. The book was published on 1986. Some of its contents are old, but I believe the thinking introduced in this book is still very useful.
November 18, 2019
Started with this version but then switched to the Java version of the book later. The content is exactly similar in both the books, however, the examples and the questions in the Java version are obviously translated to Java language. The book explains recursion together with its mathematical parallels which does indeed clarify recursion & it origins till some extent, however, it runs short in providing a mental model for recursion which some of the other books of this category do pretty well. However, the book does apply recursion to a wide variety of problems which does kind of make-up for that shortcoming. Would have rated more like 3.5 stars but could not do it.
April 15, 2020
It provides a succinct introduction to the idea of recursion, which on surface is deceptively simple. The problems at the end of chapters are fun, especially if you’re implementing them in a pure functional language like Haskell.
Displaying 1 - 4 of 4 reviews
Can't find what you're looking for?
Get help and learn more about the design.