- 160 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Quick Recursion
About This Book
Recursion is the best tool for working with trees and graphs. But perhaps you've studied recursion and decided it's too complicated. You just can't think that way. That limits the kind of programming you can do.
Good news! Recursion is actually easy. It's just badly taught.
See, many instructors talk about how the computer does it. They go on and on about what happens at each level of the recursion and how each level relates to other levels. The problem is that you can't think in multiple levels. Nobody can. And you don't have to.
This book will show you how you can write recursive programs. Once you understand a few simple rules, you will wonder why you ever thought recursion was complicated. You'll be able to write recursive programs quickly and easily.
Well, as quick and easy as programming ever is, anyway.
Frequently asked questions
Information
Table of contents
- Cover
- Half Title
- Title Page
- Copyright Page
- Dedication
- Contents
- Author
- Preface
- Chapter 1 â Understanding Recursion
- Chapter 2 â Data Structures
- Chapter 3 â Backtracking
- Afterword
- Appendix A: Quicksort in Java
- Appendix B: Quicksort in Python
- Appendix C: Binary Tree Search in Java
- Appendix D: Binary Tree Search in Python
- Appendix E: Java Debugging
- Appendix F: Python Debugging
- Appendix G: Frog Puzzle in Java
- Appendix H: Frog Puzzle in Python
- Appendix I: Map Coloring in Java
- Appendix J: Map Coloring in Python
- Appendix K: Lists in Python
- Appendix L: Trees in Java
- Index