Add TimSorterSettings for configuration and flexibility

Refactored TimSorter to introduce a TimSorterSettings class, which encapsulates configuration parameters like minMerge and minGallop. This change separates configuration concerns from the sorting logic, improving code readability, maintainability, and testability.

- Introduced TimSorterSettings class with minMerge and minGallop parameters.
- Updated TimSorter constructor to accept a settings object for configuration.
- Enhanced testability by allowing customizable settings for different test scenarios.
- Simplified TimSorter’s constructor and reduced parameter clutter.
- Facilitated future scalability by allowing easy extension of configuration options.

This change adheres to the Single Responsibility Principle (SRP) and improves flexibility in sorting behavior across different contexts.

Author: Kalkwst

Algorithms.Tests/Sorters/Comparison/TimSorterTests.cs

@@ -15,7 +15,7 @@ public static void ArraySorted(
         [Random(0, 10_000, 2000)] int n)
     {
         // Arrange
-        var sorter = new TimSorter<int>();
+        var sorter = new TimSorter<int>(new TimSorterSettings());
         var (correctArray, testArray) = RandomHelper.GetArrays(n);
 
         // Act
@@ -30,7 +30,7 @@ public static void ArraySorted(
     public static void TinyArray()
     {
         // Arrange
-        var sorter = new TimSorter<int>();
+        var sorter = new TimSorter<int>(new TimSorterSettings());
         var tinyArray = new[] { 1 };
         var correctArray = new[] { 1 };
 
@@ -45,7 +45,7 @@ public static void TinyArray()
     public static void SmallChunks()
     {
         // Arrange
-        var sorter = new TimSorter<int>();
+        var sorter = new TimSorter<int>(new TimSorterSettings());
         var (correctArray, testArray) = RandomHelper.GetArrays(800);
         Array.Sort(correctArray, IntComparer);
         Array.Sort(testArray, IntComparer);

Algorithms/Sorters/Comparison/TimSorter.cs

@@ -27,6 +27,10 @@ public class TimSorter<T> : IComparisonSorter<T>
 {
     private readonly int minMerge;
     private readonly int initMinGallop;
+
+    // Pool of reusable TimChunk objects for memory efficiency.
+    private readonly TimChunk<T>[] chunkPool = new TimChunk<T>[2];
+
     private readonly int[] runBase;
     private readonly int[] runLengths;
 
@@ -50,15 +54,16 @@ private class TimChunk<Tc>
         public int Wins { get; set; }
     }
 
-    public TimSorter(int minMerge = 32, int minGallop = 7)
+    public TimSorter(TimSorterSettings settings)
     {
         initMinGallop = minGallop;
-        this.minMerge = minMerge;
         runBase = new int[85];
         runLengths = new int[85];
 
         stackSize = 0;
-        this.minGallop = minGallop;
+
+        minGallop = settings.MinGallop;
+        minMerge = settings.MinMerge;
     }
 
     /// <summary>
@@ -631,3 +636,16 @@ private bool GallopMerge(TimChunk<T> left, TimChunk<T> right, ref int dest)
         return false;
     }
 }
+
+public class TimSorterSettings
+{
+    public int MinMerge { get; }
+
+    public int MinGallop { get; }
+
+    public TimSorterSettings(int minMerge = 32, int minGallop = 7)
+    {
+        MinMerge = minMerge;
+        MinGallop = minGallop;
+    }
+}