logo CodeStepByStep logo

printAllBinary

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

Write a recursive function named printAllBinary that accepts an integer number of digits and prints all binary numbers that have exactly that many digits, in ascending order, one per line. For example, the call of printAllBinary(3); should print:

000
001
010
011
100
101
110
111

If the number of digits passed is 0 or negative, print no output. Your function must use recursion; do not use any loops.

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

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.