Question

I have 5 bits and so 32 different combinations (of them).

Starting from

00000

and ending with

11111

Is there some way of quickly listing all possibilities? I could do it by hand, but I worry that I might miss one. I’m guessing some clever chap has written some algorithm and/or made a website, that can do this very easily. At least I hope so.

Thanks a lot.

Answer 1

In Ruby:

0b0000.upto(0b1111) {|n| puts n.to_s(2).rjust(4,"0")}

0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111