Recursion is used in programming when a solution requires performing an identical operation on a nested structure. For example, file directories often contain directories that contain directories. Navigating to the file at the innermost directory requires a recursive operation of opening a folder, then opening a folder, then opening a folder. Programmers involved in mathematical computations, such as mathematical induction, are probably the biggest users of recursion. You probably know some of the most common recursive problems; finding the factorial of a number and the Fibonacci series are both examples of recursive processes. In this course, staff instructor and Java expert Peggy Fisher explores programming solutions involving both of these problems. She reviews the concept of recursion, discusses approaches to solving problems using recursion, and examines some recursive examples.

---

Weiterführende Informationen

• Leseprobe

Personen: Fisher, Peggy