Use the default capacity as the minimum for shrinking a HashTable

Remove un-needed default comparer

Author: kamikkels

Algorithms/Sorters/Comparison/TimSorter.cs

@@ -80,7 +80,6 @@ public TimSorter(TimSorterSettings settings, IComparer<T> comparer)
     public void Sort(T[] array, IComparer<T> comparer)
     {
         ArgumentNullException.ThrowIfNull(array);
-        this.comparer = comparer ?? Comparer<T>.Default;
 
         var start = 0;
         var remaining = array.Length;

DataStructures/Hashing/HashTable.cs

@@ -286,7 +286,7 @@ public void Clear()
     public void Resize()
     {
         var newCapacity = size <= threshold / 2
-            ? capacity / 2
+            ? Math.Min(capacity / 2, DefaultCapacity)
             : capacity * 2;
         var newEntries = new Entry<TKey, TValue>[newCapacity];