LINQShuffler.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Algorithms.Shufflers
{
    /// <summary>
    ///     LINQ Shuffle is a simple shuffling algorithm,
    ///     where the elements within a collection are shuffled using
    ///     LINQ queries and lambda expressions in C#.
    /// </summary>
    /// <typeparam name="T">Type array input.</typeparam>
    public class LINQShuffler<T> : IShuffler<T>
    {
        /// <summary>
        /// First, it will generate a random value for each element.
        /// Next, it will sort the elements based on these generated
        /// random numbers using OrderBy.
        /// </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);
            array = array.OrderBy(x => random.Next()).ToArray();
        }
    }
}