Consider this List<string>
List<string> data = new List<string>();
data.Add("Text1");
data.Add("Text2");
data.Add("Text3");
data.Add("Text4");
The problem I had was: how can I get every combination of a subset of the list?
Kinda like this:
#Subset Dimension 4
Text1;Text2;Text3;Text4
#Subset Dimension 3
Text1;Text2;Text3;
Text1;Text2;Text4;
Text1;Text3;Text4;
Text2;Text3;Text4;
#Subset Dimension 2
Text1;Text2;
Text1;Text3;
Text1;Text4;
Text2;Text3;
Text2;Text4;
#Subset Dimension 1
Text1;
Text2;
Text3;
Text4;
I came up with a decent solution which a think is worth to share here.
I think, the answers in this question need some performance tests. I’ll give it a go. It is community wiki, feel free to update it.
OUTPUT:
Jodrell’s Update
I’ve built in release mode, i.e. optimizations on. When I run via Visual Studio I don’t get a consistent bias between 1 or 2, but after repeated runs LB’s answer wins, I get answers approaching something like,
but if I run the test harness from the command line, not via Visual Studio, I get results more like this