MathGroup Archive 2007

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

Search the Archive

Re: All permutations of a sequence


<< 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