Get permutations of array numbers

Question

Hello Here below is a list molex_stubs of int arrays. How to create a list of all permutation of array members where: list items are arrays of int item length is 14 (number of items in molex_stubs list 0-items of int arrays come from molex_stubs[0]  1st-item of int arrays come from molex_stubs[1]  etc. Thanks List int []> molex_stubs = new List int []>() { new int [] { 3 1 -1 -3 } new int [] { 3 1 -1 -2 } new int [] { 0 } new int [] { 4 3 1 -1 -3 -4 } new int [] { 2 1 -1 -3 } new int [] { 0 -3 } new int [] { 3 0 } new int [] { 3 1 -1 -3 } new int [] { 4 3 1 -1 -3 -4 } new int [] { 3 0 } new int [] { 2 1 -1 -3 } new int [] { 0 } new int [] { 0 -3 } new int [] { 3 1 -1 -2 } };

Pavel · Answer

Bikesh Midhun First thank you for feedback. Well ... probably I wasn't explicit enough with my last post: I've already found a solution and exposed it in my message. Regards

Bikesh Srivastava · Answer

First of all: it smells like recursion of course! Since you also wanted to know the principle I did my best to explain it human language. I think recursion is very easy most of the times. You only have to grasp two steps: The first step All the other steps (all with the same logic) In human language : In short: 1. The permutation of 1 element is one element. 2. The permutation of a set of elements is a list each of the elements concatenated with every permutation of the other elements. Example: If the set just has one element --> return it. perm(a) -> a If the set has two characters: for each element in it: return the element with the permutation of the rest of the elements added like so: perm(ab) -> a + perm(b) -> ab b + perm(a) -> ba Further: for each character in the set: return a character concatenated with a perumation of > the rest of the set perm(abc) -> a + perm(bc) --> abc  acb b + perm(ac) --> bac  bca c + perm(ab) --> cab  cba perm(abc...z) --> a + perm(...) b + perm(....)

Pavel · Answer

Resolved. Actually the issue concerned so-called Cartesian Product calculation problem. Here is the solution: namespace NestedForLoops_Recursion { public static class CartesianProductContainer { public static IEnumerable >CartesianProduct ( this IEnumerable >sequences) { IEnumerable >emptyProduct= new []{Enumerable.Empty ()}; return sequences.Aggregate( emptyProduct (accumulatorsequence)=> fromaccseq in accumulator fromitem in sequence selectaccseq.Concat( new []{item})); } } class Program { static void Main( string []args) { List int []>lst= new List int []>() { new int []{123} new int []{11223344} new int []{111222333444555} }; List int []>result= new List int []>(); foreach (varp in lst.CartesianProduct()) { result.Add(p.ToArray()); foreach ( int item in p) { Debug.Write(String.Format( {0} item)); } Debug.WriteLine(  ); } } } } And here is the Debug.Write output: 111111 111222 111333 111444 111555 122111 122222 122333 122444 122555 133111 133222 133333 133444 133555 144111 144222 144333 144444 144555 211111 211222 211333 211444 211555 222111 222222 222333 222444 222555 233111 233222 233333 233444 233555 244111 244222 244333 244444 244555 311111 311222 311333 311444 311555 322111 322222 322333 322444 322555 333111 333222 333333 333444 333555 344111 344222 344333 344444 344555

Midhun T P · Answer

Hi Please have a look at below threads- http://stackoverflow.com/questions/14643009/generate-all-possible-combinations-from-multiple-arrays-c-vb-net http://www.c-sharpcorner.com/forums/generate-combinations-of-multiple-arrays-dynamically

Pavel · Answer

Hi Ketan Thank you for feedback. At the first glance there is no similar (to mine) cases in your link. Actually my problem correspond to iteration through 14 nested for loops ... and of course can be resolved this way. I'm looking for a smart generic solution ... i.e. without having to iterate through all these for loops. If you consider that your link contains an example that more or less similar to mine could you please indicate the location of such example in the post (it's quite long). Thanks in advance.

ketan borsdiya · Answer

Hi Pavel Follow below link http://stackoverflow.com/questions/756055/listing-all-permutations-of-a-string-integer if not solved your problem then tell me..