Re: How to generate unordered selections?
- From: rob@xxxxxxxxxxxxxx (Rob Johnson)
- Date: Sat, 01 Mar 2008 11:46:40 GMT
In article <516a2005-a9a9-4fb7-908b-f9c1ed5c891d@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Jonas Bjering <depictivelogic@xxxxxxxxx> wrote:
I am looking for an algorithm to generate a specific unordered
selection based on a number.
In essence I am looking for an (pseudocode) implementation to the
following signature:
function selection(s, m, k) : set
where s is a set of length n and m is the number of elements selected
from this set and k is a number in [0, n! / (m! (n-m)!) ) and where
the result is a subset of s with m elements that is unique for every
value of k.
There was a thread a while ago about this. Take a look at
<http://groups.google.com/groups?threadm=20080125.143126@xxxxxxxx>
Rob Johnson <rob@xxxxxxxxxxxxxx>
take out the trash before replying
to view any ASCII art, display article in a monospaced font
.
- Prev by Date: Re: reading sci.math without spam
- Next by Date: Branch and bound on continuous variables?
- Previous by thread: Re: trigonometric calculations
- Next by thread: Branch and bound on continuous variables?
- Index(es):
Relevant Pages
|
