🚀 go-pugleaf

Ok I answered a similar question to this a few weeks ago.

To generate all possible combinations for a given number of symbols, you
use the quantity of symbols as a new base in a number system, 10 is the
base in decimal, 16 is the base in hexidecimal. Once you know the base
you can then use a simple mathematical process to convert an
incrementing decimal number to the new base.

Use lookup tables for the conversion process. For information on the
conversion process look at Decimal to Hex Conversion.

Regards
Adam Anderson

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.