logo CodeStepByStep logo

printAllBinary

Language/Type: Java backtracking recursion

Write a recursive method 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 method must use recursion; do not use any loops.

Type your Java solution code here:


This is a method exercise. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

You must log in before you can solve this problem.

Log In

Need help?

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

Is there a problem? Contact a site administrator.

©, all rights reserved.