Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*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 2005

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

Search the Archive

permutations

  • To: mathgroup at smc.vnet.net
  • Subject: [mg62418] permutations
  • From: Francisco Gutierrez <fgutiers2002 at yahoo.com>
  • Date: Wed, 23 Nov 2005 06:27:29 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

Dear Group:
  If I do for example:
  Permutations[{x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12}],
  my computer runs out of memory.
  This is not such a poor computer.  Actually, I would need to do permutations of lists of Length 20, perhaps 25.  I am aware these calculations are big (Length[x]!), but I wonder if there is some way around the problem. Compilating Permutations? But then how? Can somebody help me?
  Francisco Gutiérrez

		


  • Prev by Date: Timing of looping operators
  • Next by Date: Re: Timing of looping operators
  • Previous by thread: Re: Timing of looping operators
  • Next by thread: Re: permutations