Added public overload (array, seed) and private overload (array, items, seed) on RecursiveShuffler.cs.

Author: Jccqt

Algorithms.Tests/Shufflers/RecursiveShufflerTests.cs

@@ -18,7 +18,7 @@ public static void ArrayShuffled_NewArraySameSize(
             var (correctArray, testArray) = RandomHelper.GetArrays(n);
 
             // Act
-            shuffler.Shuffle(testArray, testArray.Length - 1);
+            shuffler.Shuffle(testArray);
 
             // Assert
             testArray.Length.Should().Be(correctArray.Length);
@@ -34,7 +34,7 @@ public static void ArrayShuffled_NewArraySameValues(
             var (correctArray, testArray) = RandomHelper.GetArrays(n);
 
             // Act
-            shuffler.Shuffle(testArray, testArray.Length - 1);
+            shuffler.Shuffle(testArray);
 
             // Assert
             testArray.Should().BeEquivalentTo(correctArray);
@@ -50,8 +50,8 @@ public static void ArrayShuffled_NewArraySameShuffle(
             var (correctArray, testArray) = RandomHelper.GetArrays(n);
 
             // Act
-            shuffler.Shuffle(testArray, testArray.Length - 1, seed);
-            shuffler.Shuffle(correctArray, correctArray.Length - 1, seed);
+            shuffler.Shuffle(testArray, seed);
+            shuffler.Shuffle(correctArray, seed);
 
             // Assert
             correctArray.Should().BeEquivalentTo(testArray, options => options.WithStrictOrdering());

Algorithms/Shufflers/RecursiveShuffler.cs

@@ -8,8 +8,18 @@ namespace Algorithms.Shufflers
     ///     for educational purposes due to stack depth limits.
     /// </summary>
     /// <typeparam name="T">Type array input.</typeparam>
-    public class RecursiveShuffler<T>
+    public class RecursiveShuffler<T> : IShuffler<T>
     {
+        /// <summary>
+        /// This is the public overload method that calls the private overload method.
+        /// </summary>
+        /// <param name="array">Array to shuffle.</param>
+        /// <param name="seed">Random generator seed. Used to repeat the shuffle.</param>
+        public void Shuffle(T[] array, int? seed = null)
+        {
+            Shuffle(array, array.Length - 1, seed);
+        }
+
         /// <summary>
         /// First, it will check the length of the array on the base case.
         /// Next, if there's still items left, it will shuffle the sub-array.
@@ -19,9 +29,9 @@ public class RecursiveShuffler<T>
         /// <param name="array">Array to shuffle.</param>
         /// <param name="items">Number of items in the array.</param>
         /// <param name="seed">Random generator seed. Used to repeat the shuffle.</param>
-        public void Shuffle(T[] array, int items, int? seed = null)
+        private void Shuffle(T[] array, int items, int? seed)
         {
-            if(items <= 0)
+            if (items <= 0)
             {
                 return;
             }