Update the conditions insertion sort is used (#2736)

As the documentation is referencing exact numbers it should use the condition partitionSize <= IntrospectiveSortUtilities.IntrosortSizeThreshold.

Author: adray

xml/System.Collections.Generic/List`1.xml

@@ -3605,7 +3605,7 @@ Public Function StartsWith(e As Employee) As Boolean
   
  This method uses the <xref:System.Array.Sort%2A?displayProperty=nameWithType> method, which applies the introspective sort as follows:  
   
--   If the partition size is fewer than 16 elements, it uses an insertion sort algorithm.  
+-   If the partition size is less than or equal to 16 elements, it uses an insertion sort algorithm.  
   
 -   If the number of partitions exceeds 2 log *n*, where *n* is the range of the input array, it uses a Heapsort algorithm.  
   
@@ -3687,7 +3687,7 @@ Public Function StartsWith(e As Employee) As Boolean
   
  This method uses the <xref:System.Array.Sort%2A?displayProperty=nameWithType> method, which applies the introspective sort as follows:  
   
--   If the partition size is fewer than 16 elements, it uses an insertion sort algorithm.  
+-   If the partition size is less than or equal to 16 elements, it uses an insertion sort algorithm.  
   
 -   If the number of partitions exceeds 2 log *n*, where *n* is the range of the input array, it uses a Heapsort algorithm.  
   
@@ -3765,7 +3765,7 @@ Public Function StartsWith(e As Employee) As Boolean
   
  This method uses <xref:System.Array.Sort%2A?displayProperty=nameWithType>, which applies the introspective sort as follows:  
   
--   If the partition size is fewer than 16 elements, it uses an insertion sort algorithm  
+-   If the partition size is less than or equal to 16 elements, it uses an insertion sort algorithm  
   
 -   If the number of partitions exceeds 2 log *n*, where *n* is the range of the input array, it uses a [Heapsort](https://en.wikipedia.org/wiki/Heapsort) algorithm.  
   
@@ -3851,7 +3851,7 @@ Public Function StartsWith(e As Employee) As Boolean
   
  This method uses <xref:System.Array.Sort%2A?displayProperty=nameWithType>, which applies the introspective sort as follows:  
   
--   If the partition size is fewer than 16 elements, it uses an insertion sort algorithm  
+-   If the partition size is less than or equal to 16 elements, it uses an insertion sort algorithm  
   
 -   If the number of partitions exceeds 2 log *n*, where *n* is the range of the input array, it uses a [Heapsort](https://en.wikipedia.org/wiki/Heapsort) algorithm.