Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 5 - Algorithms - Chapter Review Problems - Page 267: 44

Answer

def solve(n=0, digit=0): if digit==4: print(n) else: solve(n+1*(10**digit), digit+1) if digit<=2: solve(n+5*(10**digit), digit+1)

Work Step by Step

def solve(n=0, digit=0): if digit==4: print(n) else: solve(n+1*(10**digit), digit+1) if digit<=2: solve(n+5*(10**digit), digit+1) The given algorithm creates the numbers digit by digit. Initially the number is 0, then the all possibilities for first digit is added and function is recursively called to add next digits.
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.