rn

justcoding121 · justcoding121 · commit 609841c181b3 · 2018-11-09T10:58:39.000-05:00
diff --git a/src/Advanced.Algorithms/Sorting/CountingSort.cs b/src/Advanced.Algorithms/Sorting/CountingSort.cs
@@ -11,9 +11,9 @@ public class CountingSort
         /// <summary>
         /// Sort given integers.
         /// </summary>
-        public static int[] Sort(IEnumerable<int> array, SortDirection sortDirection = SortDirection.Ascending)
+        public static int[] Sort(IEnumerable<int> enumerable, SortDirection sortDirection = SortDirection.Ascending)
         {
-            var lengthAndMax = getLengthAndMax(array);
+            var lengthAndMax = getLengthAndMax(enumerable);
 
             var length = lengthAndMax.Item1;
             var max = lengthAndMax.Item2;
@@ -22,7 +22,7 @@ public static int[] Sort(IEnumerable<int> array, SortDirection sortDirection = S
             var countArray = new int[max + 1];
 
             //count the appearances of elements
-            foreach (var item in array)
+            foreach (var item in enumerable)
             {
                 if (item < 0)
                 {
@@ -43,7 +43,7 @@ public static int[] Sort(IEnumerable<int> array, SortDirection sortDirection = S
             var result = new int[length];
 
             //now assign result
-            foreach (var item in array)
+            foreach (var item in enumerable)
             {
                 var index = countArray[item];
                 result[sortDirection == SortDirection.Ascending ? index-1 : result.Length - index] = item;
diff --git a/src/Advanced.Algorithms/Sorting/TreeSort.cs b/src/Advanced.Algorithms/Sorting/TreeSort.cs
@@ -13,11 +13,11 @@ public class TreeSort<T> where T : IComparable
         /// <summary>
         /// Time complexity: O(nlog(n)).
         /// </summary>
-        public static IEnumerable<T> Sort(IEnumerable<T> array, SortDirection sortDirection = SortDirection.Ascending)
+        public static IEnumerable<T> Sort(IEnumerable<T> enumerable, SortDirection sortDirection = SortDirection.Ascending)
         {
             //create BST
             var tree = new RedBlackTree<T>();
-            foreach (var item in array)
+            foreach (var item in enumerable)
             {
                 tree.Insert(item);
             }

Original file line number	Diff line number	Diff line change
`@@ -13,11 +13,11 @@ public class TreeSort<T> where T : IComparable`
`13`	`13`	`/// <summary>`
`14`	`14`	`/// Time complexity: O(nlog(n)).`
`15`	`15`	`/// </summary>`
`16`		`- public static IEnumerable<T> Sort(IEnumerable<T> array, SortDirection sortDirection = SortDirection.Ascending)`
	`16`	`+ public static IEnumerable<T> Sort(IEnumerable<T> enumerable, SortDirection sortDirection = SortDirection.Ascending)`
`17`	`17`	`{`
`18`	`18`	`//create BST`
`19`	`19`	`var tree = new RedBlackTree<T>();`
`20`		`- foreach (var item in array)`
	`20`	`+ foreach (var item in enumerable)`
`21`	`21`	`{`
`22`	`22`	`tree.Insert(item);`
`23`	`23`	`}`