Applied some code styling fixes.

Author: n.bitounis

Algorithms/Numeric/BinomialCoefficients.cs

@@ -10,6 +10,8 @@ public static class BinomialCoefficients
         /// <summary>
         /// Calculate binomial coefficients, C(n, k).
         /// </summary>
+        /// <param name="n"></param>
+        /// <returns></returns>
         public static BigInteger Calculate(uint n)
         {
             return Factorial(2 * n) / (Factorial(n) * Factorial(n + 1));

Algorithms/Numeric/CatalanNumbers.cs

@@ -16,15 +16,17 @@ public static class CatalanNumbers
         /// Internal cache.
         /// By default contains the first two catalan numbers for the ranks: 0, and 1.
         /// </summary>
-        private static readonly Dictionary<uint, BigInteger> _catalanNumbers = new Dictionary<uint, BigInteger> { { 0, 1 }, { 1, 1 } };
+        private static readonly Dictionary<uint, BigInteger> CachedCatalanNumbers = new Dictionary<uint, BigInteger> { { 0, 1 }, { 1, 1 } };
 
         /// <summary>
-        /// Helper function.
+        /// Helper method.
         /// </summary>
+        /// <param name="rank"></param>
+        /// <returns></returns>
         private static BigInteger _recursiveHelper(uint rank)
         {
-            if (_catalanNumbers.ContainsKey(rank))
-                return _catalanNumbers[rank];
+            if (CachedCatalanNumbers.ContainsKey(rank))
+                return CachedCatalanNumbers[rank];
 
             BigInteger number = 0;
             var lastRank = rank - 1;
@@ -34,8 +36,8 @@ private static BigInteger _recursiveHelper(uint rank)
                 var firstPart = _recursiveHelper(i);
                 var secondPart = _recursiveHelper(lastRank - i);
 
-                if (!_catalanNumbers.ContainsKey(i)) _catalanNumbers.Add(i, firstPart);
-                if (!_catalanNumbers.ContainsKey(lastRank - i)) _catalanNumbers.Add(lastRank - i, secondPart);
+                if (!CachedCatalanNumbers.ContainsKey(i)) CachedCatalanNumbers.Add(i, firstPart);
+                if (!CachedCatalanNumbers.ContainsKey(lastRank - i)) CachedCatalanNumbers.Add(lastRank - i, secondPart);
 
                 number = number + (firstPart * secondPart);
             }
@@ -44,28 +46,35 @@ private static BigInteger _recursiveHelper(uint rank)
         }
 
         /// <summary>
-        /// Public API
+        /// Public API.
         /// </summary>
+        /// <param name="rank"></param>
+        /// <returns></returns>
         public static BigInteger GetNumber(uint rank)
         {
             // Assert the cache is not empty.
-            Debug.Assert(_catalanNumbers.Count >= 2);
+            Debug.Assert(CachedCatalanNumbers.Count >= 2);
 
             return _recursiveHelper(rank);
         }
 
         /// <summary>
         /// Calculate the number using the Binomial Coefficients algorithm
         /// </summary>
+        /// <param name="rank"></param>
+        /// <returns></returns>
         public static BigInteger GetNumberByBinomialCoefficients(uint rank)
         {
             // Calculate by binomial coefficient.
             return BinomialCoefficients.Calculate(rank);
         }
 
         /// <summary>
-        /// Return the list of catalan numbers between two ranks, inclusive.
+        /// Return the list of catalan numbers between two ranks, inclusive
         /// </summary>
+        /// <param name="fromRank"></param>
+        /// <param name="toRank"></param>
+        /// <returns></returns>
         public static List<BigInteger> GetRange(uint fromRank, uint toRank)
         {
             var numbers = new List<BigInteger>();
@@ -79,4 +88,4 @@ public static List<BigInteger> GetRange(uint fromRank, uint toRank)
             return numbers;
         }
     }
-}
+}