Thanks for even looking at my vague question. Basically, what I am trying to do is create all possible combinations of values of data from different sets. Let's say I have set1 contains the values 1,2,3,4 set2 contains the values a,b,c,d set3 contains the values A,B,C,D set4 contains the values X,Y,Z My desired output, all combinations of the above sets, is a set of data with the values: 1aAX 1aAY 1aAZ 1aBX 1aBY 1aBZ .. 1aDZ .. 1bAX 1bAY .. 4dDZ
I want to write code that can handle any # of sets of any size each. I think I have figured out a way to do this. (After giving up at work last night, it came to me while falling asleep.) I am sort of "flattening" the data by treating everything (even if #s) as a string, and merely concatenating the combinations exactly as shown above. (Well, I have to do this repeatedly -- I'm still working on the code for that.) That way, my output data retains the same dimensionality (1D, that is) regardless of the # of sets or their size. I'll let you know if I fail at this, but I think I am on the right track now.
