[Date Index] [Thread Index] [Author Index]

Re: Enumerating Permutations

• To: mathgroup at smc.vnet.net
• Subject: [mg20064] Re: [mg20006] Enumerating Permutations
• From: "Andrzej Kozlowski" <andrzej at tuins.ac.jp>
• Date: Wed, 29 Sep 1999 03:33:24 -0400
• Sender: owner-wri-mathgroup at wolfram.com

It is one of the Standard Packages. You load it with:
<<DiscreteMath`Combinatorica`
--
Andrzej Kozlowski
Toyama International University
JAPAN
http://sigma.tuins.ac.jp
http://eri2.tuins.ac.jp


----------
>From: "Vic Fanberg" <fanberg at email.msn.com>
>To: "Andrzej Kozlowski" <andrzej at tuins.ac.jp>, <mathgroup at smc.vnet.net>
>Subject: [mg20064] Re: [mg20006] Enumerating Permutations
>Date: Sun, 26 Sep 1999 09:47:52 -0400
>

>>For example:
>>
>>In[3]:=
>>NthPermutation[3, {a, b, c, d}]
>>Out[3]=
>>{a, c, d, b}
>>The algorithm that does this is the obvious one. I can describe it in words
>>if you really want it but it is better to just look at the code in the
>>Combinatorica package.
>
>
> This is exactly what I am looking for.  I just did not want to potentially
> expand the whole list of permutations before I selected one.  Where do I
> find the Conbinatorica package?
>
> Vic
>
>
>