- To: mathgroup at smc.vnet.net
- Subject: [mg62473] Re: permutations
- From: "Dana" <Dana.OnTheBeach at comcastl.com>
- Date: Fri, 25 Nov 2005 02:25:28 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
> I would need to do permutations of lists of Length 20, perhaps 25.
Here are some other ideas.
lst = Range;
The size is too big to do anything meaningful:
n = 25!
Perhaps you just want to work with a random sample from that "large" list:
If you would like to see the Permutation that is half-way in that "large"
list, perhaps more efficiently would be:
The 2nd from the end of that "large" list:
NthPermutation[n - 2, lst]
Mathematica Windows, 5.2
"Francisco Gutierrez" <fgutiers2002 at yahoo.com> wrote in message
news:dm1jov$n4c$1 at smc.vnet.net...
> Dear Group:
> If I do for example:
> 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:
Re: How to print on paper big matrixes ?
Next by Date:
Re: How does NIntegrate suppress messages?
Previous by thread:
Next by thread: