Array.Sort Method (Array, Array, Int32, Int32, IComparer)
Sorts a range of elements in a pair of onedimensional Array objects (one contains the keys and the other contains the corresponding items) based on the keys in the first Array using the specified IComparer.
Assembly: mscorlib (in mscorlib.dll)
static member Sort : keys:Array * items:Array * index:int * length:int * comparer:IComparer > unit
Parameters
 keys

Type:
System.Array
The onedimensional Array that contains the keys to sort.
 items

Type:
System.Array
The onedimensional Array that contains the items that correspond to each of the keys in the keysArray.
or
null to sort only the keysArray.
 index

Type:
System.Int32
The starting index of the range to sort.
 length

Type:
System.Int32
The number of elements in the range to sort.
 comparer

Type:
System.Collections.IComparer
The IComparer implementation to use when comparing elements.
or
null to use the IComparable implementation of each element.
Exception  Condition 

ArgumentNullException  keys is null. 
RankException  
ArgumentOutOfRangeException  index is less than the lower bound of keys. or length is less than zero. 
ArgumentException  items is not null, and the lower bound of keys does not match the lower bound of items. or items is not null, and the length of keys is greater than the length of items. or index and length do not specify a valid range in the keysArray. or items is not null, and index and length do not specify a valid range in the itemsArray. or The implementation of comparer caused an error during the sort. For example, comparer might not return 0 when comparing an item with itself. 
InvalidOperationException  comparer is null, and one or more elements in the keysArray do not implement the IComparable interface. 
Each key in the keysArray has a corresponding item in the itemsArray. When a key is repositioned during the sorting, the corresponding item in the itemsArray is similarly repositioned. Therefore, the itemsArray is sorted according to the arrangement of the corresponding keys in the keysArray.
If comparer is null, each key within the specified range of elements in the keysArray must implement the IComparable interface to be capable of comparisons with every other key.
You can sort if there are more items than keys, but the items that have no corresponding keys will not be sorted. You cannot sort if there are more keys than items; doing this throws an ArgumentException.
If the sort is not successfully completed, the results are undefined.
The .NET Framework includes predefined IComparer implementations listed in the following table.
Implementation  Description 

Compares any two objects, but performs a caseinsensitive comparison of strings.  
Compares any two objects by using the sorting conventions of the current culture.  
Compares any two objects by using the sorting conventions of the invariant culture.  
Compares two objects of type T by using the type's default sort order. 
You can also support custom comparisons by providing an instance of your own IComparer implementation to the comparer parameter. The example does this by defining a custom IComparer implementation that reverses the default sort order and performs caseinsensitive string comparison.
This method uses the introspective sort (introsort) algorithm as follows:
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.
Otherwise, it uses a Quicksort algorithm.
This implementation performs an unstable sort; that is, if two elements are equal, their order might not be preserved. In contrast, a stable sort preserves the order of elements that are equal.
For arrays that are sorted by using the Heapsort and Quicksort algorithms, in the worst case, this method is an O(n log n) operation, where n is length.
Notes to Callers:
The .NET Framework 4 and earlier versions used only the Quicksort algorithm. Quicksort identifies invalid comparers in some situations in which the sorting operation throws an IndexOutOfRangeException exception, and throws an ArgumentException exception to the caller. Starting with the .NET Framework 4.5, it is possible that sorting operations that previously threw ArgumentException will not throw an exception, because the insertion sort and heapsort algorithms do not detect an invalid comparer. For the most part, this applies to arrays with fewer than 16 elements.
The following code example shows how to sort two associated arrays where the first array contains the keys and the second array contains the values. Sorts are done using the default comparer and a custom comparer that reverses the sort order. Note that the result might vary depending on the current CultureInfo.
Available since 10
.NET Framework
Available since 1.1
Silverlight
Available since 2.0
Windows Phone Silverlight
Available since 7.0