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

MathGroup Archive 2007

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

Search the Archive

Re: All permutations of a sequence

  • To: mathgroup at smc.vnet.net
  • Subject: [mg76268] Re: All permutations of a sequence
  • From: CKWong <CKWong.P at gmail.com>
  • Date: Fri, 18 May 2007 06:30:47 -0400 (EDT)
  • References: <f2h8t7$v4$1@smc.vnet.net>

<< DiscreteMath`Combinatorica`
n = 5;
lst = Range[n];
lstP = Permutations[lst];
Select[lstP, (SignaturePermutation[#] == 1) &]

Warning:  this algorithm is very slow for large n.



  • Prev by Date: 64-bit again
  • Next by Date: Small bug in the documentation for LatticeReduce (v6)
  • Previous by thread: All permutations of a sequence
  • Next by thread: Re: All permutations of a sequence