1.
Chapter 8: Recursion Presentation slides for Java Software Solutions for AP* Computer Science by John Lewis, William Loftus, and Cara Cocking Java Software Solutions is published by Addison-Wesley Presentation slides are copyright 2002 by John Lewis, William Loftus, and Cara Cocking. All rights reserved. Instructors using the textbook may use and modify these slides for pedagogical purposes. *AP is a registered trademark of The College Entrance Examination Board which was not involved in the production of, and does not endorse, this product.
Recursion is a programming technique in which a method can call itself to solve a problem
A recursive definition is one which uses the word or concept being defined in the definition itself; when defining an English word, a recursive definition usually is not helpful
But in other situations, a recursive definition can be an appropriate way to express a concept
Before applying recursion to programming, it is best to practice thinking recursively
Just because we can use recursion to solve a problem, doesn't mean we should
For instance, we usually would not use recursion to solve the sum of 1 to N problem, because the iterative version is easier to understand; in fact, there is a formula which is superior to both recursion and iteration!
You must be able to determine when recursion is the correct technique to use
We can use recursion to find a path through a maze; a path can be found from any location if a path can be found from any of the location’s neighboring locations
At each location we encounter, we mark the location as “visited” and we attempt to find a path from that location’s “unvisited” neighbors
Recursion keeps track of the path through the maze
The base cases are an prohibited move or arrival at the final destination
Views
Actions
Embeds 0
Report content