|
|
|
| Perl: the Markov chain saw | |
| PerlMonks |
(tye)Re: Permutationsby tye (Sage) |
| on Mar 21, 2001 at 22:54 UTC ( [id://66191]=note: print w/replies, xml ) | Need Help?? |
This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.
"Combinations" is picking subsets where order doesn't matter. For "permutations", order matters and you use the full set, not subsets. So mentioning "combinations" when computing permutations is going to confuse people. My favorite is Permuting with duplicates and no memory. A simple search or Super Search will turn up lots of other ones. - tye (but my friends call me "Tye")
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||