logo CodeStepByStep logo


Language/Type: C++ backtracking recursion
Author: Marty Stepp (on 2016/06/16)

Write a recursive function named printAllDecimal that accepts an integer number of digits and prints all base-10 numbers that have exactly that many digits, in ascending order, one per line, with leading zeros in front as needed. For example, the call of printAllDecimal(3); should print:


If the number of digits passed is 0 or negative, print no output. Your function must use recursion, but you can use a single for loop if necessary.

Type your C++ solution code here:

This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.

Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.