bssdmw@gdr.bath.ac.uk (D M Webster) writes:
>I need either an algorithm or code to produce a non-redundant
>series of permutations. What I mean by this is for example
>given ABC I want the permutations for say groups of 2 letters
>i.e. AB
> AC
> BC
>
> I don't want to consider BA, CA, or CB.
>
>As an added complication I want to be able to generate these
>patterns for any number of combinations. That is given for example
>given 6 items I may want unique patterns of 5,4,3 groups or any
>number I choose.
>
>Thanks.
>
>
>David Webster bssdmw@uk.ac.bath.gdr
Classic problem. almost a homework problem. (is it?)
It should be in the FAQ for comp.lang.prolog or comp.lang.pop, I have cross
posted to them since I couldn't find it in their FAQ's....
David (whitten@fwva.saic.com) US:(619)535-7764 [I don't speak as a company rep.]
|