Quick Recursion

Cover
Half Title
Title Page
Copyright Page
Dedication
Contents
Author
Preface
Chapter 1. Understanding Recursion
	1.1 A Note on Languages
	1.2 Recursive Definitions
	1.3 A Simple Recursive Procedure
	1.4 Factorial
	1.5 The Principle of Information Hiding
	1.6 When to Use Recursion
	1.7 When Not to Use Recursion
	1.8 The Four Rules
		1.8.1 Rule 1. Handle the Base Cases First
		1.8.2 Rule 2. Recur Only with a Simpler Case
			1.8.2.1 An Aside: The Collatz Conjecture
		1.8.3 Rule 3. Don't Use External Variables
			1.8.3.1 Deep Copies
		1.8.4 Rule 4. Don't Look Down
	1.9 What the Computer Does
	1.10 Removing Recursion
	1.11 Tail Recursion
	1.12 Recursive Drawings
	1.13 Fortran and Lisp
Chapter 2. Data Structures
	2.1 Arrays
		2.1.1 Array Maximum
		2.1.2 Quicksort
	2.2 Lists
		2.2.1 Lists in Java
		2.2.2 Lists in Python
		2.2.3 Accumulators
	2.3 Binary Trees
		2.3.1 Printing Binary Trees
		2.3.2 Counting Nodes
	2.4 Trees
		2.4.1 Parse Trees
		2.4.2 Indirect Recursion
Chapter 3. Backtracking
	3.1 The Backtracking Algorithm
	3.2 Nonrecursive Backtracking
	3.3 Keeping Backtracking Simple
	3.4 Pruning and Four Coloring
	3.5 Binary Tree Search I
	3.6 Binary Tree Search II
	3.7 Tree and Graph Searches
	3.8 Debugging Techniques
	3.9 The Frog Puzzle
	3.10 Frogs Accumulator
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