Add Naive shuffling algorithm

Algorithms.Tests/Shufflers/NaiveShufflerTests.cs

@@ -0,0 +1,60 @@
+using Algorithms.Shufflers;
+using Algorithms.Tests.Helpers;
+using FluentAssertions;
+using NUnit.Framework;
+using System;
+
+namespace Algorithms.Tests.Shufflers
+{
+    public static class NaiveShufflerTests
+    {
+        [Test]
+        public static void ArrayShuffled_NewArraySameSize(
+            [Random(10, 1000, 100, Distinct = true)]
+            int n)
+        {
+            // Arrange
+            var shuffler = new NaiveShuffler<int>();
+            var (correctArray, testArray) = RandomHelper.GetArrays(n);
+
+            // Act
+            shuffler.Shuffle(testArray);
+
+            // Assert
+            testArray.Length.Should().Be(correctArray.Length);
+        }
+
+        [Test]
+        public static void ArrayShuffled_NewArraySameValues(
+            [Random(10, 1000, 100, Distinct = true)]
+            int n)
+        {
+            // Arrange
+            var shuffler = new NaiveShuffler<int>();
+            var (correctArray, testArray) = RandomHelper.GetArrays(n);
+
+            // Act
+            shuffler.Shuffle(testArray);
+
+            // Assert
+            testArray.Should().BeEquivalentTo(correctArray);
+        }
+
+        [Test]
+        public static void ArrayShuffled_NewArraySameShuffle(
+            [Random(0, 1000, 2, Distinct = true)] int n,
+            [Random(1000, 10000, 5, Distinct = true)] int seed)
+        {
+            // Arrange
+            var shuffle = new LinqShuffler<int>();
+            var (correctArray, testArray) = RandomHelper.GetArrays(n);
+
+            // Act
+            shuffle.Shuffle(testArray, seed);
+            shuffle.Shuffle(correctArray, seed);
+
+            // Assert
+            correctArray.Should().BeEquivalentTo(testArray, options => options.WithStrictOrdering());
+        }
+    }
+}

Algorithms/Shufflers/NaiveShuffler.cs

@@ -0,0 +1,31 @@
+using System;
+
+namespace Algorithms.Shufflers
+{
+    /// <summary>
+    ///     Naive Shuffle is a simple and incorrect shuffling algorithm
+    ///     that randomly swaps every element with any other element in the array.
+    /// </summary>
+    /// <typeparam name="T">Type array input.</typeparam>
+    public class NaiveShuffler<T> : IShuffler<T>
+    {
+        /// <summary>
+        /// First, it loop from 0 to n - 1.
+        /// Next, it will randomly pick any j in the array.
+        /// Lastly, it will swap array[i] with array[j].
+        /// </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)
+        {
+            var random = seed is null ? new Random() : new Random(seed.Value);
+            for(int i = 0; i < array.Length; i++)
+            {
+                int j = random.Next(array.Length);
+                T temp = array[i];
+                array[i] = array[j];
+                array[j] = temp;
+            }
+        }
+    }
+}

README.md

@@ -149,6 +149,7 @@ find more than one implementation for the same objective but using different alg
   * [Shufflers](./Algorithms/Shufflers)
     * [Fisher-Yates Shuffler](./Algorithms/Shufflers/FisherYatesShuffler.cs)
     * [LINQ Shuffler](./Algorithms/Shufflers/LinqShuffler.cs)
+    * [Naive Shuffler](./Algorithms/Shufflers/NaiveShuffler.cs)
   * [Sequences](./Algorithms/Sequences)
     * [A000002 Kolakoski](./Algorithms/Sequences/KolakoskiSequence.cs)
     * [A000004 Zero](./Algorithms/Sequences/ZeroSequence.cs)