Rearranged the code and added comments

Author: KroneckerX

Algorithms/Numeric/GreatestCommonDivisor.cs

@@ -1,7 +1,16 @@
-namespace Algorithms.Numeric
+/***
+ * Euclidean Algorithm to find the greatest common divisor of two numbers.
+ * 
+ */
+
+
+namespace Algorithms.Numeric
 {
     public static class GreatestCommonDivisor
     {
+        /// <summary>
+        /// Finds and returns the greatest common divisor of two numbers
+        /// </summary>
         public static uint FindGCD(uint a, uint b)
         {
             if (a == 0)
@@ -24,6 +33,9 @@ public static uint FindGCD(uint a, uint b)
             return _b;
         }
 
+        /// <summary>
+        /// Determines given two numbers are relatively prime
+        /// </summary>
         public static bool IsRelativelyPrime(uint a, uint b)
         {
             return FindGCD(a, b) == 1;

MainProgram/AlgorithmsTests/GreatestCommonDivisorTest.cs

@@ -1,9 +1,7 @@
 using System;
-using System.Collections.Generic;
-using System.Diagnostics;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+
+using Algorithms.Numeric;
+
 
 namespace C_Sharp_Algorithms.AlgorithmsTests
 {
@@ -26,7 +24,7 @@ public static void DoTest()
 
             for (int i = 0; i < testNumbers.GetLength(0); i++)
             {
-                uint gcd = Algorithms.Numeric.GreatestCommonDivisor.FindGCD(testNumbers[i, 0], testNumbers[i, 1]);
+                uint gcd = GreatestCommonDivisor.FindGCD(testNumbers[i, 0], testNumbers[i, 1]);
 
                 if (Assert(testNumbers[i,0], testNumbers[i,1], gcd))
                 {