Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1999
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1999

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

Search the Archive

Re: Enumerating Permutations

  • To: mathgroup at smc.vnet.net
  • Subject: [mg20063] Re: [mg20006] Enumerating Permutations
  • From: "Vic Fanberg" <fanberg at email.msn.com>
  • Date: Wed, 29 Sep 1999 03:33:24 -0400
  • Sender: owner-wri-mathgroup at wolfram.com

>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





  • Prev by Date: Re: List-Selection
  • Next by Date: Re: Enumerating Permutations
  • Previous by thread: Re: Enumerating Permutations
  • Next by thread: Re: Enumerating Permutations