Hi!
This is not connected with Delphi but with algorithms in general. Does
anyone know how can I get the results of a non-repeatative combination on a
random set?
For example, 3-elemented combinations on {a,b,c,d} are abc,abd,acd,bcd.I know how to get all the permutations, but don't know how to extract the n-elemented classes from them. Any ideas? Pseudo-code is ok too ;) Gajo _______________________________________________ Delphi mailing list [EMAIL PROTECTED] http://ns3.123.co.nz/mailman/listinfo/delphi
