This topic has not yet been rated - Rate this topic

Array.Sort Method (Array, Array, Int32, Int32, IComparer)

April 12, 2014

Sorts a range of elements in a pair of one-dimensional 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.

Namespace:  System
Assembly:  mscorlib (in mscorlib.dll)
public static void Sort(
	Array keys,
	Array items,
	int index,
	int length,
	IComparer comparer


Type: System.Array
The one-dimensional Array that contains the keys to sort.
Type: System.Array
The one-dimensional Array that contains the items that correspond to each of the keys in the keysArray.
null to sort only the keysArray.
Type: System.Int32
The starting index of the range to sort.
Type: System.Int32
The number of elements in the range to sort.
Type: System.Collections.IComparer
The IComparer implementation to use when comparing elements.
null to use the IComparable implementation of each element.

keys is null.


The keysArray is multidimensional.


The itemsArray is multidimensional.


index is less than the lower bound of keys.


length is less than zero.


items is not null, and the lower bound of keys does not match the lower bound of items.


items is not null, and the length of keys is greater than the length of items.


index and length do not specify a valid range in the keysArray.


items is not null, and index and length do not specify a valid range in the itemsArray.


The implementation of comparer caused an error during the sort. For example, comparer might not return 0 when comparing an item with itself.


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.

If the sort is not successfully completed, the results are undefined.

This method uses the 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.

On average, this method is an O(n log n) operation, where n is length; in the worst case it is an O(n ^ 2) operation.

Windows Phone OS

Supported in: 8.1, 8.0, 7.1, 7.0

Windows Phone

Did you find this helpful?
(1500 characters remaining)
Thank you for your feedback
© 2014 Microsoft. All rights reserved.