By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
454,915 Members | 1,268 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 454,915 IT Pros & Developers. It's quick & easy.

ordered subset problem

P: n/a
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
Aug 1 '05 #1
Share this Question
Share on Google+
2 Replies


P: n/a
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
Aug 1 '05 #2

P: n/a
"akarl" <fu********@comhem.se> wrote in message
news:I3*********************@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?
Aug 1 '05 #3

This discussion thread is closed

Replies have been disabled for this discussion.