Loading video...
Algorithms: Recursion
- Recursion is when a method calls itself
- A recursive call must be made with a different value than the method itself was called with
- A recursive method must contain a conditional statement that will eventually cause it to exit without calling itself again
- The case that causes the method to exit without calling itself again is called a base case
- Calculating factorial numbers is a common recursive algorithm
- Calculating Fibonacci numbers is a common recursive algorithm
Algorithms: Recursion
Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.



































Start Learning Now
Our free lessons will get you started (Flash® 10 required).
Sign up for Educator.comGet immediate access to our entire library.
Features Overview