logo CodeStepByStep logo

Main Page → Exercises → Java → Solve an Exercise

countBinary

Language/Type: Java recursion recursive backtracking

Write a method countBinary that accepts an integer n as a parameter and that prints all binary numbers that have n digits in ascending order, printing each value on a separate line. All n digits should be shown for all numbers, including leading zeros if necessary. You may assume that n is non-negative. If n is 0, a blank line of output should be produced. Do not use a loop in your solution; implement it recursively.

Call Output 
countBinary(1);
 
0
1

countBinary(2);
 
00
01
10
11

countBinary(3);
 
000
001
010
011
100
101
110
111

Hint: It may help to define a private helper method that accepts different parameters than the original method. In particular, consider building up a set of characters as a String for eventual printing.

Method: Write a Java method as described, not a complete program or class.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.