If the 2 is fixed then the easiest thing I can think about is just generating the new array with N*(N-1)/2 rows, one for each sum and then using two variables to iterate through the original array with something like:s int c = 0; for (int i = 0; i < N; i++) { for … Read more
Just create an iterator method using yield return, like so: public class Combinations: IEnumerable<Combination> { public IEnumerator<T> GetEnumerator() { Combination currentCombination = Combination.FirstCombination(); while (currentCombination.IsValid()) { yield return currentCombination; currentCombination = currentCombination.NextCombination(); // return invalid combo if currentCombination is the last possible combination } } } Of course you still have to write the Combination … Read more
static void Main() { var cnk = comb(new [] {1,2,3},2); foreach ( var c in cnk) { } } public static IEnumerable<int[]> comb(int[] a, int k) { if (a == null || a.Length == 0 || k < 1 || k > a.Length) yield break; int n = a.Length; // 1 if ( k == … Read more
I have one done the same with strings. However, I just swapped random digits until I get all combinations(which is the factorial of the length of the string). I then print out the non-recurring ones. Here is how I did it, just change the String you input to the allpos() method and it will work … Read more
You could use a nested for loop: for (int i = 0; i < courses[0].Length; i++) { for (int j = 0; j < courses[1].Length; i++) { for (int k = 0; k < courses[2].Length; i++) { //Do whatever you need with the combo, accessed like: //courses[0][i], courses[1][j], courses[2][k] } } } Of course, this … Read more