MathGroup Archive 1999

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

Search the Archive

Re: Enumerating Permutations

  • To: mathgroup at
  • Subject: [mg20064] Re: [mg20006] Enumerating Permutations
  • From: "Andrzej Kozlowski" <andrzej at>
  • Date: Wed, 29 Sep 1999 03:33:24 -0400
  • Sender: owner-wri-mathgroup at

It is one of the Standard Packages. You load it with:
Andrzej Kozlowski
Toyama International University

>From: "Vic Fanberg" <fanberg at>
>To: "Andrzej Kozlowski" <andrzej at>, <mathgroup at>
>Subject: [mg20064] Re: [mg20006] Enumerating Permutations
>Date: Sun, 26 Sep 1999 09:47:52 -0400

>>For example:
>>NthPermutation[3, {a, b, c, d}]
>>{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

  • Prev by Date: Re: Enumerating Permutations
  • Next by Date: Re: Out[1]=((5-Sqrt[5])/20 + (5+Sqrt[5])/20 ) == 1/2 ???
  • Previous by thread: Re: Enumerating Permutations
  • Next by thread: initstate problems