Thinking Recursively with Java, 20th Anniversary Edition
November 2005, ©2006
May fit a variety of Java programming courses as a supplement at the introductory or intermediate levels or serve as a core text in intermediate or advanced level programming courses.
1. The Idea of Recursion.
2. Mathematical Preliminaries.
3. Recursive Functions.
4. The Procedural Approach.
5. The Tower of Hanoi.
8. Recursive Backtracking.
9. Graphical Applications.
10. Recursive Data.
11. Implementation of Recursion.
- The examples have been rewritten to use Java instead of Pascal, making the book compatible with modern approaches to introductory computer science.
- The code used in the book is designed to be fully compatible with the libraries produced by the ACM Java Task Force, as well as with other standard approaches to teaching Java.
- The chapters on recursive backtracking and graphical applications have been expanded to support interesting examples enabled by current technology.
- The author is widely recognized as an expert teacher and has won numerous teaching awards at Stanford. He was the principal author of the ACM/IEEE-CS report on Computing Curricula 2001 and received the ACM-SIGCSE Award for Outstanding Contributions to Computer Science Education in 2003.
- Wiley E-Texts are powered by VitalSource technologies e-book software.
- With Wiley E-Texts you can access your e-book how and where you want to study: Online, Download and Mobile.
- Wiley e-texts are non-returnable and non-refundable.
- WileyPLUS registration codes are NOT included with the Wiley E-Text. For informationon WileyPLUS, click here .
- To learn more about Wiley e-texts, please refer to our FAQ.
- E-books are offered as e-Pubs or PDFs. To download and read them, users must install Adobe Digital Editions (ADE) on their PC.
- E-books have DRM protection on them, which means only the person who purchases and downloads the e-book can access it.
- E-books are non-returnable and non-refundable.
- To learn more about our e-books, please refer to our FAQ.