From: Tom Best <thomas.j.best@...>
Date: 2009-08-10T03:05:11+09:00
Subject: Generate binary sequences of length n?

I'm rather new to Ruby.  I feel this should be very simple, but I'm
having trouble:

I'd like to write a script to work through all possible binary sequences
of length n.



The script would work as follows:

mylength = 4
resultz = binary_seq_generator(mylength)
puts "#{resultz}"

#resultz, not necessarily in this order:
["0000","0001","0010","0011","0100","0101","0110","0111","1000","1001","1010","1011","1100","1101","1110","1111"]



Important to my use:  This binary_seq_generator method must be written
in such a way so that each subsequent member of the resultz array would
be completely generated before the next member starts.  This is where
I'm stuck.  I have trying manipulating the graycode algorithm here:
http://yagni.com/graycode/

This graycode algorithm seems to produce an array where each member is
only finalized on the final recurse.  I may be wrong...but by this
method, I can't use resultz[i] for something before the algorithm starts
to build resultz[i+1], and I need to use each member of the resultz
array before moving on to the next binary string in the sequence.

Thanks much for helping a newbie!
-- 
Posted via http://www.ruby-forum.com/.