Clean up combinatorics

justcoding121 · justcoding121 · commit 887436049094 · 2022-07-14T11:03:40.000-06:00
diff --git a/src/Advanced.Algorithms/Combinatorics/Combination.cs b/src/Advanced.Algorithms/Combinatorics/Combination.cs
@@ -17,7 +17,7 @@ public static List<List<T>> Find<T>(List<T> n, int r, bool withRepetition = fals
             return result;
         }
 
-        private static void recurse<T>(List<T> input, int r, bool withRepetition,
+        private static void recurse<T>(List<T> n, int r, bool withRepetition,
             int k, List<T> prefix, HashSet<int> prefixIndices,
             List<List<T>> result)
         {
@@ -27,17 +27,17 @@ private static void recurse<T>(List<T> input, int r, bool withRepetition,
                 return;
             }
 
-            for (int j = k; j < input.Count; j++)
+            for (int j = k; j < n.Count; j++)
             {
                 if (prefixIndices.Contains(j) && !withRepetition)
                 {
                     continue;
                 }
 
-                prefix.Add(input[j]);
+                prefix.Add(n[j]);
                 prefixIndices.Add(j);
 
-                recurse(input, r, withRepetition, j, prefix, prefixIndices, result);
+                recurse(n, r, withRepetition, j, prefix, prefixIndices, result);
 
                 prefix.RemoveAt(prefix.Count - 1);
                 prefixIndices.Remove(j);
diff --git a/src/Advanced.Algorithms/Combinatorics/Permutation.cs b/src/Advanced.Algorithms/Combinatorics/Permutation.cs
@@ -17,7 +17,7 @@ public static List<List<T>> Find<T>(List<T> n, int r, bool withRepetition = fals
             return result;
         }
 
-        private static void recurse<T>(List<T> input, int r, bool withRepetition,
+        private static void recurse<T>(List<T> n, int r, bool withRepetition,
             List<T> prefix, HashSet<int> prefixIndices,
             List<List<T>> result)
         {
@@ -27,17 +27,17 @@ private static void recurse<T>(List<T> input, int r, bool withRepetition,
                 return;
             }
 
-            for (int j = 0; j < input.Count; j++)
+            for (int j = 0; j < n.Count; j++)
             {
                 if (prefixIndices.Contains(j) && !withRepetition)
                 {
                     continue;
                 }
 
-                prefix.Add(input[j]);
+                prefix.Add(n[j]);
                 prefixIndices.Add(j);
 
-                recurse(input, r, withRepetition, prefix, prefixIndices, result);
+                recurse(n, r, withRepetition, prefix, prefixIndices, result);
 
                 prefix.RemoveAt(prefix.Count - 1);
                 prefixIndices.Remove(j);

Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ public static List<List<T>> Find<T>(List<T> n, int r, bool withRepetition = fals`
`17`	`17`	`return result;`
`18`	`18`	`}`
`19`	`19`
`20`		`- private static void recurse<T>(List<T> input, int r, bool withRepetition,`
	`20`	`+ private static void recurse<T>(List<T> n, int r, bool withRepetition,`
`21`	`21`	`int k, List<T> prefix, HashSet<int> prefixIndices,`
`22`	`22`	`List<List<T>> result)`
`23`	`23`	`{`
`@@ -27,17 +27,17 @@ private static void recurse<T>(List<T> input, int r, bool withRepetition,`
`27`	`27`	`return;`
`28`	`28`	`}`
`29`	`29`
`30`		`- for (int j = k; j < input.Count; j++)`
	`30`	`+ for (int j = k; j < n.Count; j++)`
`31`	`31`	`{`
`32`	`32`	`if (prefixIndices.Contains(j) && !withRepetition)`
`33`	`33`	`{`
`34`	`34`	`continue;`
`35`	`35`	`}`
`36`	`36`
`37`		`- prefix.Add(input[j]);`
	`37`	`+ prefix.Add(n[j]);`
`38`	`38`	`prefixIndices.Add(j);`
`39`	`39`
`40`		`- recurse(input, r, withRepetition, j, prefix, prefixIndices, result);`
	`40`	`+ recurse(n, r, withRepetition, j, prefix, prefixIndices, result);`
`41`	`41`
`42`	`42`	`prefix.RemoveAt(prefix.Count - 1);`
`43`	`43`	`prefixIndices.Remove(j);`