Hey all,
I'm looking for a quick & easy, 1 to 'n' type routine.
For example, if I have a list, 'A,B,C,D,E,F,G,H' the routine would return all combinations. Essentially returning n^(n-1) combinations. I don't mind writing it but I was just wondering if one had already been done....
Example:
'A,B,C,D,E,F,H,G'
'A,B,C,D,E,H,G,F'
'A,B,C,D,H,G,F,E'
etc...
Thanks!
DD
Best,
DD
A man is no fool who gives up that which he cannot keep for that which he cannot lose.
Everything I don't understand must be easy!
The difficulty of any task is measured by the capacity of the agent performing the work.
