# Calculating all possible combinations

Hello,

this probebly is a common task, but my programming skills are still under development. I need the algorithm to create all possible combinations for a 8 digit code that can be 1 or 0. I think i need recursion but i can't seem to get it right.
Here's an example of what i mean... (Output on the screen)

00000000
00000001
00000010
00000011
00000100
00000101
00000110
00000111
...

• You don't need recursion. It is quite simple. Just loop through from 0 to 255. Convert each value to binary. The binary is the ones and zeros that you output. 255 in binary is 11111111, by the way.

: Hello,
:
: this probebly is a common task, but my programming skills are still under development. I need the algorithm to create all possible combinations for a 8 digit code that can be 1 or 0. I think i need recursion but i can't seem to get it right.
: Here's an example of what i mean... (Output on the screen)
:
: 00000000
: 00000001
: 00000010
: 00000011
: 00000100
: 00000101
: 00000110
: 00000111
: ...
:
: Can somebody help me please...
: