complete enumeration
I need to know how to completely enumerate an array to see every possible combination of the entries. The entries in the array are of type double. What I need is code that well give every possible combination of the entries. So, for example, if the array is of size 3, then I need to be able to go through all 3!=6 possibilities. These may need to be called permutations. Thanks in advance for all help.
[410 byte] By [
bullDawga] at [2007-11-27 6:24:23]
You might do well to read through one day's worth of threads on this forum before asking a question here. You'll see that folks that ask that work be done for them are treated very differently than those who do their own work but need help on a specific question in this work. I suggest that you follow the latter course. Believe me, you will get much better help and have a much more rewarding experience.
I look forward to seeing your work. Good luck!
> I need to know how to completely enumerate an array to see every possible combination of the entries.Better get to studying, then.> What I need is code that well give every possible combination of the entries.Best start writing code,
