Array.Sort Method (Array, Int32, Int32)
[ This article is for Windows Phone 8 developers. If you’re developing for Windows 10, see the latest documentation. ]
Sorts the elements in a range of elements in a one-dimensional Array using the IComparable implementation of each element of the Array.
Assembly: mscorlib (in mscorlib.dll)
'Declaration Public Shared Sub Sort ( _ array As Array, _ index As Integer, _ length As Integer _ )
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.
| Exception | Condition |
|---|---|
| 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. |
| InvalidOperationException | One or more elements in array do not implement the IComparable interface. |
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.