Array.Sort<TKey, TValue> Method (array<TKey[], array<TValue[])
Microsoft Silverlight will reach end of support after October 2021. Learn more.
Sorts a pair of Array objects (one contains the keys and the other contains the corresponding items) based on the keys in the first Array using the IComparable<T> generic interface implementation of each key.
Namespace: System
Assembly: mscorlib (in mscorlib.dll)
Syntax
'Declaration
Public Shared Sub Sort(Of TKey, TValue) ( _
keys As TKey(), _
items As TValue() _
)
public static void Sort<TKey, TValue>(
TKey[] keys,
TValue[] items
)
Type Parameters
- TKey
The type of the elements of the key array.
- TValue
The type of the elements of the items array.
Exceptions
| Exception | Condition |
|---|---|
| ArgumentNullException | keys is nulla null reference (Nothing in Visual Basic). |
| ArgumentException | items is not nulla null reference (Nothing in Visual Basic), and the lower bound of keys does not match the lower bound of items. -or- items is not nulla null reference (Nothing in Visual Basic), and the length of keys is greater than the length of items. |
| InvalidOperationException | One or more elements in the keysArray do not implement the IComparable<T> generic interface. |
Remarks
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.
Each key in the keysArray must implement the IComparable<T> generic 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.
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 array; in the worst case it is an O(n ^ 2) operation.
Examples
The following code example demonstrates the Sort<TKey, TValue>(array<TKey[], array<TValue[]), Sort<TKey, TValue>(array<TKey[], array<TValue[], IComparer<TKey>), Sort<TKey, TValue>(array<TKey[], array<TValue[], Int32, Int32), and Sort<TKey, TValue>(array<TKey[], array<TValue[], Int32, Int32, IComparer<TKey>) generic method overloads, for sorting pairs of arrays that represent keys and values.
The code example defines an alternative comparer for strings, named ReverseCompare, which implements the IComparer<string> (IComparer(Of String) in Visual Basic, IComparer<String^> in Visual C++) generic interface. The comparer calls the CompareTo(String) method, reversing the order of the comparands so that the strings sort high-to-low instead of low-to-high.
The code example creates and displays an array of dinosaur names (the keys) and an array of integers representing the maximum length of each dinosaur in meters (the values). The arrays are then sorted and displayed several times:
The Sort<TKey, TValue>(array<TKey[], array<TValue[]) overload is used to sort both arrays in order of the dinosaur names in the first array.
The Sort<TKey, TValue>(array<TKey[], array<TValue[], IComparer<TKey>) overload and an instance of ReverseCompare are used to reverse the sort order of the paired arrays.
The Sort<TKey, TValue>(array<TKey[], array<TValue[], Int32, Int32) overload is used to sort the last three elements of both arrays.
The Sort<TKey, TValue>(array<TKey[], array<TValue[], Int32, Int32, IComparer<TKey>) overload is used to sort the last three elements of both arrays in reverse order.
.gif "Note") Note: |
|---|
The calls to the generic methods do not look any different from calls to their nongeneric counterparts, because Visual Basic, C#, and C++ infer the type of the generic type parameter from the type of the first two arguments. |
| Note: |
|---|
To run this example, see Building Examples That Use a Demo Method and a TextBlock Control. |
Imports System.Collections.Generic
Public Class ReverseComparer
Implements IComparer(Of String)
Public Function Compare(ByVal x As String, _
ByVal y As String) As Integer _
Implements IComparer(Of String).Compare
' Compare y and x in reverse order.
Return y.CompareTo(x)
End Function
End Class
Public Class Example
Public Shared Sub Demo(ByVal outputBlock As System.Windows.Controls.TextBlock)
Dim dinosaurs() As String = { _
"Seismosaurus", _
"Chasmosaurus", _
"Coelophysis", _
"Mamenchisaurus", _
"Caudipteryx", _
"Cetiosaurus"}
Dim dinosaurSizes() As Integer = {40, 5, 3, 22, 1, 18}
outputBlock.Text &= vbCrLf
For i As Integer = 0 To dinosaurs.Length - 1
outputBlock.Text &= String.Format("{0}: up to {1} meters long.", _
dinosaurs(i), dinosaurSizes(i)) & vbCrLf
Next
outputBlock.Text &= String.Format(vbLf & _
"Sort(dinosaurs, dinosaurSizes)") & vbCrLf
Array.Sort(dinosaurs, dinosaurSizes)
outputBlock.Text &= vbCrLf
For i As Integer = 0 To dinosaurs.Length - 1
outputBlock.Text &= String.Format("{0}: up to {1} meters long.", _
dinosaurs(i), dinosaurSizes(i)) & vbCrLf
Next
Dim rc As New ReverseComparer()
outputBlock.Text &= String.Format(vbLf & _
"Sort(dinosaurs, dinosaurSizes, rc)") & vbCrLf
Array.Sort(dinosaurs, dinosaurSizes, rc)
outputBlock.Text &= vbCrLf
For i As Integer = 0 To dinosaurs.Length - 1
outputBlock.Text &= String.Format("{0}: up to {1} meters long.", _
dinosaurs(i), dinosaurSizes(i)) & vbCrLf
Next
outputBlock.Text &= String.Format(vbLf & _
"Sort(dinosaurs, dinosaurSizes, 3, 3)") & vbCrLf
Array.Sort(dinosaurs, dinosaurSizes, 3, 3)
outputBlock.Text &= vbCrLf
For i As Integer = 0 To dinosaurs.Length - 1
outputBlock.Text &= String.Format("{0}: up to {1} meters long.", _
dinosaurs(i), dinosaurSizes(i)) & vbCrLf
Next
outputBlock.Text &= String.Format(vbLf & _
"Sort(dinosaurs, dinosaurSizes, 3, 3, rc)") & vbCrLf
Array.Sort(dinosaurs, dinosaurSizes, 3, 3, rc)
outputBlock.Text &= vbCrLf
For i As Integer = 0 To dinosaurs.Length - 1
outputBlock.Text &= String.Format("{0}: up to {1} meters long.", _
dinosaurs(i), dinosaurSizes(i)) & vbCrLf
Next
End Sub
End Class
' This code example produces the following output:
'
'Seismosaurus: up to 40 meters long.
'Chasmosaurus: up to 5 meters long.
'Coelophysis: up to 3 meters long.
'Mamenchisaurus: up to 22 meters long.
'Caudipteryx: up to 1 meters long.
'Cetiosaurus: up to 18 meters long.
'
'Sort(dinosaurs, dinosaurSizes)
'
'Caudipteryx: up to 1 meters long.
'Cetiosaurus: up to 18 meters long.
'Chasmosaurus: up to 5 meters long.
'Coelophysis: up to 3 meters long.
'Mamenchisaurus: up to 22 meters long.
'Seismosaurus: up to 40 meters long.
'
'Sort(dinosaurs, dinosaurSizes, rc)
'
'Seismosaurus: up to 40 meters long.
'Mamenchisaurus: up to 22 meters long.
'Coelophysis: up to 3 meters long.
'Chasmosaurus: up to 5 meters long.
'Cetiosaurus: up to 18 meters long.
'Caudipteryx: up to 1 meters long.
'
'Sort(dinosaurs, dinosaurSizes, 3, 3)
'
'Seismosaurus: up to 40 meters long.
'Mamenchisaurus: up to 22 meters long.
'Coelophysis: up to 3 meters long.
'Caudipteryx: up to 1 meters long.
'Cetiosaurus: up to 18 meters long.
'Chasmosaurus: up to 5 meters long.
'
'Sort(dinosaurs, dinosaurSizes, 3, 3, rc)
'
'Seismosaurus: up to 40 meters long.
'Mamenchisaurus: up to 22 meters long.
'Coelophysis: up to 3 meters long.
'Chasmosaurus: up to 5 meters long.
'Cetiosaurus: up to 18 meters long.
'Caudipteryx: up to 1 meters long.
using System;
using System.Collections.Generic;
public class ReverseComparer : IComparer<string>
{
public int Compare(string x, string y)
{
// Compare y and x in reverse order.
return y.CompareTo(x);
}
}
public class Example
{
public static void Demo(System.Windows.Controls.TextBlock outputBlock)
{
string[] dinosaurs = {
"Seismosaurus",
"Chasmosaurus",
"Coelophysis",
"Mamenchisaurus",
"Caudipteryx",
"Cetiosaurus" };
int[] dinosaurSizes = { 40, 5, 3, 22, 1, 18 };
outputBlock.Text += "\n";
for (int i = 0; i < dinosaurs.Length; i++)
{
outputBlock.Text += String.Format("{0}: up to {1} meters long.",
dinosaurs[i], dinosaurSizes[i]) + "\n";
}
outputBlock.Text += String.Format("\nSort(dinosaurs, dinosaurSizes)") + "\n";
Array.Sort(dinosaurs, dinosaurSizes);
outputBlock.Text += "\n";
for (int i = 0; i < dinosaurs.Length; i++)
{
outputBlock.Text += String.Format("{0}: up to {1} meters long.",
dinosaurs[i], dinosaurSizes[i]) + "\n";
}
ReverseComparer rc = new ReverseComparer();
outputBlock.Text += String.Format("\nSort(dinosaurs, dinosaurSizes, rc)") + "\n";
Array.Sort(dinosaurs, dinosaurSizes, rc);
outputBlock.Text += "\n";
for (int i = 0; i < dinosaurs.Length; i++)
{
outputBlock.Text += String.Format("{0}: up to {1} meters long.",
dinosaurs[i], dinosaurSizes[i]) + "\n";
}
outputBlock.Text += String.Format("\nSort(dinosaurs, dinosaurSizes, 3, 3)") + "\n";
Array.Sort(dinosaurs, dinosaurSizes, 3, 3);
outputBlock.Text += "\n";
for (int i = 0; i < dinosaurs.Length; i++)
{
outputBlock.Text += String.Format("{0}: up to {1} meters long.",
dinosaurs[i], dinosaurSizes[i]) + "\n";
}
outputBlock.Text += String.Format("\nSort(dinosaurs, dinosaurSizes, 3, 3, rc)") + "\n";
Array.Sort(dinosaurs, dinosaurSizes, 3, 3, rc);
outputBlock.Text += "\n";
for (int i = 0; i < dinosaurs.Length; i++)
{
outputBlock.Text += String.Format("{0}: up to {1} meters long.",
dinosaurs[i], dinosaurSizes[i]) + "\n";
}
}
}
/* This code example produces the following output:
Seismosaurus: up to 40 meters long.
Chasmosaurus: up to 5 meters long.
Coelophysis: up to 3 meters long.
Mamenchisaurus: up to 22 meters long.
Caudipteryx: up to 1 meters long.
Cetiosaurus: up to 18 meters long.
Sort(dinosaurs, dinosaurSizes)
Caudipteryx: up to 1 meters long.
Cetiosaurus: up to 18 meters long.
Chasmosaurus: up to 5 meters long.
Coelophysis: up to 3 meters long.
Mamenchisaurus: up to 22 meters long.
Seismosaurus: up to 40 meters long.
Sort(dinosaurs, dinosaurSizes, rc)
Seismosaurus: up to 40 meters long.
Mamenchisaurus: up to 22 meters long.
Coelophysis: up to 3 meters long.
Chasmosaurus: up to 5 meters long.
Cetiosaurus: up to 18 meters long.
Caudipteryx: up to 1 meters long.
Sort(dinosaurs, dinosaurSizes, 3, 3)
Seismosaurus: up to 40 meters long.
Mamenchisaurus: up to 22 meters long.
Coelophysis: up to 3 meters long.
Caudipteryx: up to 1 meters long.
Cetiosaurus: up to 18 meters long.
Chasmosaurus: up to 5 meters long.
Sort(dinosaurs, dinosaurSizes, 3, 3, rc)
Seismosaurus: up to 40 meters long.
Mamenchisaurus: up to 22 meters long.
Coelophysis: up to 3 meters long.
Chasmosaurus: up to 5 meters long.
Cetiosaurus: up to 18 meters long.
Caudipteryx: up to 1 meters long.
*/
Version Information
Silverlight
Supported in: 5, 4, 3
Silverlight for Windows Phone
Supported in: Windows Phone OS 7.1, Windows Phone OS 7.0
XNA Framework
Supported in: Xbox 360, Windows Phone OS 7.0
Platforms
For a list of the operating systems and browsers that are supported by Silverlight, see Supported Operating Systems and Browsers.