a program about all of partitions from set

Question

1.00/5 (3 votes)

See more:

I need a program about all of partitions from set
example:
set:{1,2,3}
all of partitions:
1.{{1},{2},{3}}
2.{{1,2},{3}}
3.{{1},{2,3}}
4.{{1,3},{2}}

Posted 30-Nov-11 20:22pm

nooshin nagh

Add a Solution

Comments

Sergey Alexandrovich Kryukov 1-Dec-11 2:28am

Not a question.
--SA

Sergey Alexandrovich Kryukov 1-Dec-11 2:29am

Also, the problem is not fully formulated. And this is too simple. You need to show what have you done.
--SA

OriginalGriff 1-Dec-11 3:06am

What have you tried so far? Anything?

[no name] 1-Dec-11 4:20am

*Sigh* The homework assignments just don't get any more interesting. If I were him, I would quickly learn how to [hint]climb a tree[/hint].

Richard MacCutchan 1-Dec-11 5:30am

Can you serve fries from a tree?

[no name] 1-Dec-11 5:35am

I know how to organize his sets in a tree, so I will not have to worry about having to serve fries. Probably trees and fries are mutually exclusive

Smithers-Jones 1-Dec-11 6:15am

If a fries servant (does this word exist at all?) falls out of a tree in a forest, and Ronald McDonald isn't there to witness, will the employment statistics at McDonald's drop?

nooshin nagh 2-Dec-11 13:34pm

I can't do thing for it :(

BillWoodruff 1-Dec-11 22:15pm

It appears, in this "combinatorial" problem, there's an ordering principle suggested by your example results: but, the last example: {{1,3},{2}} seems to suggest an out-of-order.

If the last example is legal, then why shouldn't { {2}, {1,3} } be legal ?

Once you've got the "ordering principle" fully specified, and some code written that at least partially gets to your solution, do come back and post questions, showing the code here.

nooshin nagh 2-Dec-11 13:29pm

because in sets is not diffrenet between {{2},{2,3}} and {{1,3},{2}}.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

BillWoodruff · Answer 1 · 2011-12-02T11:25:00

NN: "not diffrenet between {{2},{2,3}} and {{1,3},{2}}"

I think you made a typing error here when you wrote "{{2},{2,3}}. But, at least you are making a first step towards precisely stating your requirements. You have just specified that each permutation that includes two elements is a 'true' set: which means {1,3} and {3,1} are equivalent ... this requirement, for example, I believe (but am not totally sure) would rule out using the 'Distinct operator in Linq.

CodeProject is your friend: "Permutations, Combinations, and Variations using C# Generics" by Adrian Akison"[^] !

And this blog post by Eric Lippert, "Computing a Cartesian Product with LINQ"[^], may be helpful.

Next: show us some code, whether you Linq, or opt for other types of composition :)