Get all combinations of an array ( if i remove them 1 by 1 ) [duplicate]

Question

Given:

{1,2,3}

Expected result:

{1,2,3}, {1,2},{1,3},{2,3}, {1},{2},{3}

So I want basically ALL possible combinations in a list ( but including all possible combinations of - when every element is removed ).

I hope you get what I mean ;)

Question: Which algorithm achieves this?

You may want to read "Introduction to Algorithms", any sophisticated library will have that in stock. — mbx
– mbx, Commented Apr 6, 2013 at 16:50

user325117 · Accepted Answer · 2013-04-06 16:47:01Z

4

You want the power set algorithm.

There are some examples on Rosetta Code.

answered Apr 6, 2013 at 16:47

user325117

Sign up to request clarification or add additional context in comments.

2 Comments

You could at least copy-paste C# code from that site ... Otherwise it's more like a comment, not an answer.

@MarcinJuraszek Thanks for your comment, I was just about to start writing a python recursive function which does this... :D