This book is now obsolete Please use CSAwesome instead.
12.13. Recursion Summary¶
In this chapter you learned about recursion. A recursive method calls itself (contains a call to the method from inside of the method). A recursive method should have at least one way to stop the recursion. This is called a base case.
12.13.1. Concept Summary¶
base case - A way to stop the recursive calls. This is a return without a recursive call.
call stack - A class defines what all objects of that class know (fields) and can do (methods). You can also have data and behavior in the object that represents the class (class fields and methods). All objects of a class have access to class fields and class methods, but these can also be accessed using
recursive method - A method that contains at least one call to itself inside the method.
12-11-1: Drag the item from the left and drop it on its corresponding answer on the right. Click the "Check Me" button to see if you are correct.
Review the summaries above.
- A method that calls itself
- recursive method
- The stack of calls to methods
- call stack
- The case when the method doesn't call itself
- base case