🚀 go-pugleaf

Here's one way to think about it, and possibly come up with an
algorithm.  First, how many combinations are there of three things?
[You listed 7].  How about 2 things?  One thing?  Is the pattern
obvious?  Next, given N things, each "thing"  is either a member of a
particular combination or it is not, i.e. there are two possible
"states" for each of the N things.  You now only need to enumerate (i.e.
count) them.  If you can figure out the "natural" mapping between these
N things and numbers, your problem will be mostly solved.

Bob Schor
Pascal Enthusiast

Andrew wrote:

> Anyone have any pascal code for all possible combinations of a set?
>
> So if we start with '1','2','3' the possible combinations are:
>
> 1
> 2
> 3
> 1 2
> 1 3
> 2 3
> 1 2 3
>
> This seems to be a FAQ on discussion groups in general, but
> I could not find anything in Pascal.  I found some C++ code
> in another group but it looks like bad pseudocode to me -- I'm
> kindof a pascal diehard.  But I'm not a big programmer
> and this problem has my brain in knots right now.
>
> A response in any flavor of pascal would be much appreciated.
>
> TIA,
>
>   Andrew
> --
> Andrew
> noymer@my-deja.com
>
> Sent via Deja.com http://www.deja.com/
> Before you buy.