fix heap bulk init

Author: justcoding121

Advanced.Algorithms.Tests/DataStructures/Heap/Max/BMaxHeap_Tests.cs

@@ -16,13 +16,10 @@ public class BMaxHeap_Tests
         [TestMethod]
         public void BMaxHeap_Test()
         {
+            var rnd = new Random();
 
-            var initial = new List<int>();
-
-            for (int i = 50; i >=0; i--)
-            {
-                initial.Add(i);
-            }
+            var initial = new List<int>(Enumerable.Range(0, 51)
+                .OrderBy(x => rnd.Next()));
 
             //insert test
             var tree = new BMaxHeap<int>(initial);
@@ -38,7 +35,7 @@ public void BMaxHeap_Test()
                 Assert.AreEqual(Max, 99 - i);
             }
 
-            var rnd = new Random();
+ 
             var testSeries = Enumerable.Range(1, 49)
                 .OrderBy(x => rnd.Next()).ToList();
 

Advanced.Algorithms.Tests/DataStructures/Heap/Max/D-aryMaxHeap_Tests.cs

@@ -16,16 +16,12 @@ public class AsD_aryMaxTree_Tests
         [TestMethod]
         public void AsD_aryHeap_Test()
         {
-            var initial = new List<int>();
+            var rnd = new Random();
 
-            for (int i = 0; i <= 50; i++)
-            {
-                initial.Add(i);
-            }
+            var initial = new List<int>(Enumerable.Range(0, 51)
+                .OrderBy(x => rnd.Next()));
 
-            //insert test
             var tree = new D_aryMaxHeap<int>(4, initial);
-
             for (int i = 51; i <= 99; i++)
             {
                 tree.Insert(i);
@@ -37,7 +33,6 @@ public void AsD_aryHeap_Test()
                 Assert.AreEqual(max, i);
             }
 
-            var rnd = new Random();
             var testSeries = Enumerable.Range(1, 49).OrderBy(x => rnd.Next()).ToList();
 
             foreach (var item in testSeries)

Advanced.Algorithms.Tests/DataStructures/Heap/Min/BMinHeap_Tests.cs

@@ -16,13 +16,8 @@ public class BMinHeap_Tests
         [TestMethod]
         public void BMinHeap_Test()
         {
-
-            var initial = new List<int>();
-
-            for (int i = 0; i <= 50; i++)
-            {
-                initial.Add(i);
-            }
+            var rnd = new Random();
+            var initial = Enumerable.Range(0, 51).OrderBy(x => rnd.Next()).ToList();
 
             //insert test
             var tree = new BMinHeap<int>(initial);
@@ -38,7 +33,7 @@ public void BMinHeap_Test()
                 Assert.AreEqual(min, i);
             }
 
-            var rnd = new Random();
+          
             var testSeries = Enumerable.Range(1, 49).OrderBy(x => rnd.Next()).ToList();
 
             foreach (var item in testSeries)

Advanced.Algorithms.Tests/DataStructures/Heap/Min/D-aryMinHeap_Tests.cs

@@ -16,12 +16,8 @@ public class AsD_aryMinTree_Tests
         [TestMethod]
         public void AsD_aryHeap_Test()
         {
-            var initial = new List<int>();
-
-            for (int i = 0; i <= 50; i++)
-            {
-                initial.Add(i);
-            }
+            var rnd = new Random();
+            var initial = Enumerable.Range(0, 51).OrderBy(x => rnd.Next()).ToList();
 
             //insert test
             var tree = new D_aryMinHeap<int>(4, initial);
@@ -37,7 +33,6 @@ public void AsD_aryHeap_Test()
                 Assert.AreEqual(min, i);
             }
 
-            var rnd = new Random();
             var testSeries = Enumerable.Range(1, 49).OrderBy(x => rnd.Next()).ToList();
 
             foreach (var item in testSeries)

Advanced.Algorithms/DataStructures/Heap/Max/BMaxHeap.cs

@@ -22,7 +22,7 @@ public BMaxHeap(IEnumerable<T> initial = null)
                 var initArray = new T[initial.Count()];
 
                 int i = 0;
-                foreach (var item in initial.OrderByDescending(x=>x))
+                foreach (var item in initial)
                 {
                     initArray[i] = item;
                     i++;

Advanced.Algorithms/DataStructures/Heap/Max/d-aryMaxHeap.cs

@@ -20,7 +20,7 @@ public D_aryMaxHeap(int k, IEnumerable<T> initial = null)
                 var initArray = new T[initial.Count()];
 
                 int i = 0;
-                foreach (var item in initial.OrderByDescending(x=>x))
+                foreach (var item in initial)
                 {
                     initArray[i] = item;
                     i++;

Advanced.Algorithms/DataStructures/Heap/Min/BMinHeap.cs

@@ -22,7 +22,7 @@ public BMinHeap(IEnumerable<T> initial = null)
                 var initArray = new T[initial.Count()];
 
                 int i = 0;
-                foreach(var item in initial.OrderBy(x=>x))
+                foreach(var item in initial)
                 {
                     initArray[i] = item;
                     i++;