[permutations] - minor cleanup / refact

Author: ivandrofly

Algorithms/Strings/Permutations.cs

@@ -12,7 +12,6 @@ public static class Permutations
         /// <summary>
         /// Private Helper. Computes permutations recursively for string source.
         /// </summary>
-        /// <param name="s">S.</param>
         private static HashSet<string> _permutations(string source)
         {
             var perms = new HashSet<string>();
@@ -56,9 +55,9 @@ private static HashSet<string> _mergePermutations(HashSet<string> permutations,
         /// <summary>
         /// Computes the permutations of a string.
         /// </summary>
-        public static HashSet<string> ComputeDistinct(string Source)
+        public static HashSet<string> ComputeDistinct(string source)
         {
-            return _permutations(Source);
+            return _permutations(source);
         }
 
         /// <summary>
@@ -68,13 +67,13 @@ public static bool IsAnargram(string source, string other)
         {
             if (string.IsNullOrEmpty(source) || string.IsNullOrEmpty(other))
                 return false;
-            else if (source.Length != other.Length)
+            if (source.Length != other.Length)
                 return false;
-            else if (source.Equals(other, StringComparison.Ordinal))
+            if (source.Equals(other, StringComparison.Ordinal))
                 return true;
 
             int len = source.Length;
-            // Hash set which will contains all the characters present in input souce.
+            // Hash set which will contains all the characters present in input source.
             var hashSetSourceChars = new HashSet<char>();
             var hashSetOtherChars = new HashSet<char>();
             for (int i = 0; i < len; i++)