SelectionSorter.cs

using System.Collections.Generic;

namespace Algorithms.Sorters.Comparison;

/// <summary>
///     Class that implements selection sort algorithm.
/// </summary>
/// <typeparam name="T">Type of array element.</typeparam>
public class SelectionSorter<T> : IComparisonSorter<T>
{
    /// <summary>
    ///     Sorts array using specified comparer,
    ///     internal, in-place, stable,
    ///     time complexity: O(n^2),
    ///     space complexity: O(1),
    ///     where n - array length.
    /// </summary>
    /// <param name="array">Array to sort.</param>
    /// <param name="comparer">Compares elements.</param>
    public void Sort(T[] array, IComparer<T> comparer)
    {
        for (var i = 0; i < array.Length - 1; i++)
        {
            var jmin = i;
            for (var j = i + 1; j < array.Length; j++)
            {
                if (comparer.Compare(array[jmin], array[j]) > 0)
                {
                    jmin = j;
                }
            }

            var t = array[i];
            array[i] = array[jmin];
            array[jmin] = t;
        }
    }
}