logo CodeStepByStep logo

Main Page → Exercises → Python → Solve an Exercise

count_binary

Language/Type: Python recursion recursive backtracking

Write a function count_binary 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 
count_binary(1)
 
0
1

count_binary(2)
 
00
01
10
11

count_binary(3)
 
000
001
010
011
100
101
110
111
Function: Write a Python function as described, not a complete program.

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.