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

May 11, 2014

Sorts the elements in a range of elements in a one-dimensional Array using the specified IComparer.

Namespace:  System
Assembly:  mscorlib (in mscorlib.dll)

'Declaration
Public Shared Sub Sort ( _
	array As Array, _
	index As Integer, _
	length As Integer, _
	comparer As IComparer _
)

Parameters

array
Type: System.Array
The one-dimensional Array to sort.
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-
Nothing to use the IComparable implementation of each element.

ExceptionCondition
ArgumentNullException

array is Nothing.

RankException

array is multidimensional.

ArgumentOutOfRangeException

index is less than the lower bound of array.

-or-

length is less than zero.

ArgumentException

index and length do not specify a valid range in array.

-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 Nothing, and one or more elements in array do not implement the IComparable interface.

If comparer is Nothing, each element within the specified range of elements in array must implement the IComparable interface to be capable of comparisons with every other element in array.

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

Show:
© 2014 Microsoft