Partitions

You have this comment littered throughout this document (and on List.Sort also)
"If the partition size is fewer than 16 elements, it uses an insertion sort algorithm.

If the number of partitions exceeds 2 * LogN, where N is the range of the input array, it uses a Heapsort algorithm."

These are the only places where partitions are mentioned. Can you explain better how your partitioning is done and how to determine how many partitions there will be?

---
#### Document Details

⚠ *Do not edit this section. It is required for docs.microsoft.com ➟ GitHub issue linking.*

* ID: 9bbc52fb-14ee-c54a-f8fa-66765472d723
* Version Independent ID: 2e15fc32-02f3-977a-44dd-52b0e04185b2
* Content: [Array.Sort Method (System)](https://docs.microsoft.com/en-us/dotnet/api/system.array.sort?view=netframework-4.7.2)
* Content Source: [xml/System/Array.xml](https://github.com/dotnet/dotnet-api-docs/blob/master/xml/System/Array.xml)
* Product: **dotnet-api**
* GitHub Login: @dotnet-bot
* Microsoft Alias: **dotnetcontent**