| Topic: |
DEVELOP > c-Plus-Plus |
| User: |
"John Trunek" |
| Date: |
01 Aug 2005 03:36:18 AM |
| Object: |
ordered subset problem |
I need to obtain all the ordered subsets of containing 7 elements from a
list of 15 elements. From what I remember, the number of ordered sets is
given by the formula
numOfSets = 15! / (15-8)! = 32,432,400
Unfortunately, I'm not familiar with permutation algorithms. Could someone
please point me in the right direction to solve this problem?
John
.
|
|
| User: "akarl" |
|
| Title: Re: ordered subset problem |
01 Aug 2005 06:54:16 AM |
|
|
John Trunek wrote:
I need to obtain all the ordered subsets of containing 7 elements from a
list of 15 elements. From what I remember, the number of ordered sets is
given by the formula
numOfSets = 15! / (15-8)! = 32,432,400
Unfortunately, I'm not familiar with permutation algorithms. Could someone
please point me in the right direction to solve this problem?
Sure,
comp.lang.programming
August
.
|
|
|
| User: "John Trunek" |
|
| Title: Re: ordered subset problem |
01 Aug 2005 06:19:01 PM |
|
|
"akarl" <fusionfive@comhem.se> wrote in message
news:I3oHe.143089$dP1.496862@newsc.telia.net...
John Trunek wrote:
I need to obtain all the ordered subsets of containing 7 elements from a
list of 15 elements. From what I remember, the number of ordered sets is
given by the formula
numOfSets = 15! / (15-8)! = 32,432,400
Unfortunately, I'm not familiar with permutation algorithms. Could
someone please point me in the right direction to solve this problem?
Sure,
comp.lang.programming
August
Any good free combinatorics libraries that might have this functionality?
.
|
|
|
|
|
|
Related Articles |
|
|
