CHAPTER 13
Recursion
CHAPTER CONTENTS
13.1 Simple Recursion: Identifying the General and Base Cases
13.2 Recursion with a Return Value
13.2.1 Computing the Factorial of a Number
13.2.2 Computing the Greatest Common Divisor
13.3 Recursion with Two Base Cases
13.4 Programming Activity 1: Checking for a Palindrome
13.5 Binary Search: A Recursive Solution
13.6 Programming Activity 2: The Towers of Hanoi
13.7 Recursion Versus Iteration
13.9 Exercises, Problems, and Projects
13.9.1 Multiple Choice Exercises
13.9.2 Reading and Understanding Code
13.9.4 Identifying Errors in Code
13.9.5 Debugging Area—Using Messages from the Java Compiler and Java JVM
No credit card required