Introduction to Programming using Python 1st Edition

Published by Pearson
ISBN 10: 0132747189
ISBN 13: 978-0-13274-718-9

Chapter 15 - Recursion - Section 15.2 - Case Study: Computing Factorials - Check Point - MyProgrammingLab - Page 503: 15.6


A recursion that never ends is known as an infinite recursion.

Work Step by Step

If recursion does not reduce the problem in a manner that allows it to eventually converge into the base case, infinite recursion can occur. For example, suppose you mistakenly write the factorial function as follows: def : return n * The function runs infinitely and causes a RuntimeError. The example discussed so far shows a recursive function that invokes itself. This is known as $direct$ $recursion$. It is also possible to create $indirect$ $recursion$. This occurs when function A invokes function B, which in turn invokes function A. There can even be several more functions involved in the recursion. For example, function A invokes function B, which invokes function C, which invokes function A.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.