Array.Sort Method (Array, Array, IComparer)
Assembly: mscorlib (in mscorlib.dll)
'Declaration Public Shared Sub Sort ( _ keys As Array, _ items As Array, _ comparer As IComparer _ )
- Type: System.Array
The one-dimensional Array that contains the items that correspond to each of the keys in the keysArray.
Nothing to sort only the keysArray.
keys is Nothing.
The keysArray is multidimensional.
The itemsArray is multidimensional.
items is not Nothing, and the lower bound of keys does not match the lower bound of items.
items is not Nothing, and the length of keys is greater than the length of items.
The implementation of comparer caused an error during the sort. For example, comparer might not return 0 when comparing an item with itself.
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.
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.
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 the Length of keys; in the worst case it is an O(n ^ 2) operation.