Merge pull request #14 from justcoding121/master

Beta

Author: justcoding121

.build/build.ps1

@@ -109,7 +109,7 @@ Task Document -depends Build {
 		git config --global user.email $env:github_email
 		git config --global user.name "buildbot121"
 		git add . -A
-		git commit -m "Maintanance commit by build server"
+		git commit -m "API documentation update by build server"
 		git push origin master
 
 		#move cd back to current location

.gitignore

@@ -202,4 +202,7 @@ FakesAssemblies/
 *.plg
 
 # Visual Studio 6 workspace options file
-*.opt
+*.opt
+
+# Docfx
+docs/manifest.json

Advanced.Algorithms.Tests/BitAlgorithms/GCD_Tests.cs

@@ -14,10 +14,10 @@ public class GCD_Tests
         [TestMethod]
         public void GCD_Smoke_Test()
         {
-            Assert.AreEqual(3, GCD.Find(-9, 3));
-            Assert.AreEqual(15, GCD.Find(45, 30));
+            Assert.AreEqual(3, Gcd.Find(-9, 3));
+            Assert.AreEqual(15, Gcd.Find(45, 30));
 
-            Assert.AreEqual(1, GCD.Find(3, 5));
+            Assert.AreEqual(1, Gcd.Find(3, 5));
 
         }
     }

Advanced.Algorithms.Tests/BitAlgorithms/IsMultipleOfNine_Tests.cs

@@ -8,10 +8,7 @@
 
 namespace Advanced.Algorithms.Tests.BitAlgorithms
 {
-    /// <summary>
-    /// Problem details below
-    /// http://www.geeksforgeeks.org/divisibility-9-using-bitwise-operators/
-    /// </summary>
+
     [TestClass]
     public class IsMultipleOfNine_Tests
     {

Advanced.Algorithms.Tests/BitAlgorithms/IsMultipleOfThree_Tests.cs

@@ -8,10 +8,7 @@
 
 namespace Advanced.Algorithms.Tests.BitAlgorithms
 {
-    /// <summary>
-    /// Problem details below
-    /// http://www.geeksforgeeks.org/write-an-efficient-method-to-check-if-a-number-is-multiple-of-3/
-    /// </summary>
+
     [TestClass]
     public class IsMultipleOfThree_Tests
     {

Advanced.Algorithms.Tests/BitAlgorithms/NextPowOfTwo_Tests.cs

@@ -8,10 +8,7 @@
 
 namespace Advanced.Algorithms.Tests.BitAlgorithms
 {
-    /// <summary>
-    /// Problem details below
-    /// http://www.geeksforgeeks.org/smallest-power-of-2-greater-than-or-equal-to-n/
-    /// </summary>
+
     [TestClass]
     public class NextPowOfTwo_Tests
     {

Advanced.Algorithms.Tests/DataStructures/Dictionary/Dictionary_Tests.cs

@@ -14,7 +14,7 @@ public class Dictionary_Tests
         [TestMethod]
         public void Dictionary_SeparateChaining_Test()
         {
-            var Dictionary = new AsDictionary<int, int>(DictionaryType.SeparateChaining);
+            var Dictionary = new Dictionary<int, int>(DictionaryType.SeparateChaining);
             int nodeCount = 1000 * 10;
             //insert test
 
@@ -60,7 +60,7 @@ public void Dictionary_SeparateChaining_Test()
         [TestMethod]
         public void Dictionary_OpenAddressing_Test()
         {
-            var Dictionary = new AsDictionary<int, int>(DictionaryType.OpenAddressing);
+            var Dictionary = new Dictionary<int, int>(DictionaryType.OpenAddressing);
             int nodeCount = 1000 * 10;
             //insert test
 

Advanced.Algorithms.Tests/DataStructures/Dictionary/TreeDictionary_Tests.cs

@@ -14,7 +14,7 @@ public class TreeDictionary_Tests
         [TestMethod]
         public void TreeDictionary_Test()
         {
-            var Dictionary = new AsTreeDictionary<int, int>();
+            var Dictionary = new TreeDictionary<int, int>();
 
             int nodeCount = 1000;
             //insert test

Advanced.Algorithms.Tests/DataStructures/HashSet/HashSet_Tests.cs

@@ -14,7 +14,7 @@ public class HashSet_Tests
         [TestMethod]
         public void HashSet_SeparateChaining_Test()
         {
-            var HashSet = new AsHashSet<int>(HashSetType.SeparateChaining);
+            var HashSet = new HashSet<int>(HashSetType.SeparateChaining);
             int nodeCount = 1000 * 10;
             //insert test
 
@@ -60,7 +60,7 @@ public void HashSet_SeparateChaining_Test()
         [TestMethod]
         public void HashSet_OpenAddressing_Test()
         {
-            var HashSet = new AsHashSet<int>(HashSetType.OpenAddressing);
+            var HashSet = new HashSet<int>(HashSetType.OpenAddressing);
             int nodeCount = 1000 * 10;
             //insert test
 

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

@@ -14,7 +14,7 @@ public class AsD_aryMinTree_Tests
         /// A tree test
         /// </summary>
         [TestMethod]
-        public void AsD_aryHeap_Test()
+        public void D_aryHeap_Test()
         {
             var rnd = new Random();
             var initial = Enumerable.Range(0, 51).OrderBy(x => rnd.Next()).ToList();