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.4 - Problem Solving using Recursion - Check Point - MyProgrammingLab - Page 507: 15.12

Answer

In the given function the value of n is change to n/10, but in python the division operator will convert the value of n to float and calculate exactly the value of n/10, so n will never become exactly zero which is the base case for the recursion hence the recursion will never end.

Work Step by Step

The above mentioned problem can be solved by replacing n/10 by n//10, which will round off the decimal part and hence the value of n will eventually become 0.
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.