Fix typo GDC => GCD

Author: PatrykOlejniczak

Algorithms/Numeric/GreatestCommonDivisor.cs

@@ -7,7 +7,7 @@ public static class GreatestCommonDivisor
         /// <summary>
         ///     Returns the greatest common divisor of two numbers using Euclidean Algorithm.
         /// </summary>
-        public static int FindGDCEuclidean(int a, int b)
+        public static int FindGCDEuclidean(int a, int b)
         {
             a = Math.Abs(a);
             b = Math.Abs(b);
@@ -33,7 +33,7 @@ private static int Euclidean(int a, int b)
         /// <summary>
         ///     Returns the greatest common divisor of two numbers using Stein Algorithm.
         /// </summary>
-        public static int FindGDCStein(int a, int b)
+        public static int FindGCDStein(int a, int b)
         {
             a = Math.Abs(a);
             b = Math.Abs(b);

UnitTest/AlgorithmsTests/GreatestCommonDivisorTests.cs

@@ -6,83 +6,83 @@ namespace UnitTest.AlgorithmsTests
     public class GreatestCommonDivisorTests
     {
         [Fact]
-        public void FindGDC_BothAreZero()
+        public void FindGCD_BothAreZero()
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(0, 0);
-            Assert.Equal(0, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(0, 0);
+            Assert.Equal(0, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(0, 0);
-            Assert.Equal(0, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(0, 0);
+            Assert.Equal(0, gcdStein);
         }
 
         [Theory]
         [InlineData(0, 4, 4)]
         [InlineData(0, 9, 9)]
         [InlineData(0, -14, 14)]
         [InlineData(0, -99, 99)]
-        public void FindGDC_FirstIsZero(int a, int b, int expected)
+        public void FindGCD_FirstIsZero(int a, int b, int expected)
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(a, b);
-            Assert.Equal(expected, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(a, b);
+            Assert.Equal(expected, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(a, b);
-            Assert.Equal(expected, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(a, b);
+            Assert.Equal(expected, gcdStein);
         }
 
         [Theory]
         [InlineData(4, 0, 4)]
         [InlineData(9, 0, 9)]
         [InlineData(-14, 0, 14)]
         [InlineData(-99, 0, 99)]
-        public void FindGDC_SecondIsZero(int a, int b, int expected)
+        public void FindGCD_SecondIsZero(int a, int b, int expected)
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(a, b);
-            Assert.Equal(expected, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(a, b);
+            Assert.Equal(expected, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(a, b);
-            Assert.Equal(expected, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(a, b);
+            Assert.Equal(expected, gcdStein);
         }
 
         [Theory]
         [InlineData(2, 4, 2)]
         [InlineData(27, 9, 9)]
         [InlineData(27, 14, 1)]
         [InlineData(9, 6, 3)]
-        public void FindGDC_BothNumberArePositive(int a, int b, int expected)
+        public void FindGCD_BothNumberArePositive(int a, int b, int expected)
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(a, b);
-            Assert.Equal(expected, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(a, b);
+            Assert.Equal(expected, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(a, b);
-            Assert.Equal(expected, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(a, b);
+            Assert.Equal(expected, gcdStein);
         }
 
         [Theory]
         [InlineData(-2, -4, 2)]
         [InlineData(-27, -9, 9)]
         [InlineData(-27, -14, 1)]
         [InlineData(-9, -6, 3)]
-        public void FindGDC_BothNumberAreNegative(int a, int b, int expected)
+        public void FindGCD_BothNumberAreNegative(int a, int b, int expected)
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(a, b);
-            Assert.Equal(expected, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(a, b);
+            Assert.Equal(expected, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(a, b);
-            Assert.Equal(expected, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(a, b);
+            Assert.Equal(expected, gcdStein);
         }
 
         [Theory]
         [InlineData(2, -4, 2)]
         [InlineData(-27, 9, 9)]
         [InlineData(27, -14, 1)]
         [InlineData(-9, 6, 3)]
-        public void FindGDC_CombinationPositiveAndNegative(int a, int b, int expected)
+        public void FindGCD_CombinationPositiveAndNegative(int a, int b, int expected)
         {
-            var gdcEuclidean = GreatestCommonDivisor.FindGDCEuclidean(a, b);
-            Assert.Equal(expected, gdcEuclidean);
+            var gcdEuclidean = GreatestCommonDivisor.FindGCDEuclidean(a, b);
+            Assert.Equal(expected, gcdEuclidean);
 
-            var gdcStein = GreatestCommonDivisor.FindGDCStein(a, b);
-            Assert.Equal(expected, gdcStein);
+            var gcdStein = GreatestCommonDivisor.FindGCDStein(a, b);
+            Assert.Equal(expected, gcdStein);
         }
     }
 }