Will Woods wrote:
The range of N I need is from 5-100, which spans the highly likely to
highly improbable for M around 1000-1. The permutation can be
derived from an integer using the algorithm here:
http://en.wikipedia.org/wiki/Permutation
You really, really don't want to do it this
The range of N I need is from 5-100, which spans the highly likely to
highly improbable for M around 1000-1. The permutation can be
derived from an integer using the algorithm here:
http://en.wikipedia.org/wiki/Permutation
I have found the solution to the random number generator in the
Will Woods wrote:
I want to choose a subset of all possible permutations of a sequence of
length N, with each element of the subset unique. This is then going to
be scattered across multiple machines using mpi. Since there is a
one-to-one mapping between the integers in the range 0 = x N!
On 14/06/07, Will Woods [EMAIL PROTECTED] wrote:
I want to choose a subset of all possible permutations of a sequence of
length N, with each element of the subset unique. This is then going to
be scattered across multiple machines using mpi. Since there is a
one-to-one mapping between the
