System Namespace   Array Class

---

Sorts 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 interface.

[ VB ]
<Serializable>
Overloads Public 
Shared Sub Sort ( _
   ByVal keys As Array, _
   ByVal items As Array, _
   ByVal comparer As IComparer _
)

[ C# ]
[Serializable]
public static void Sort (
   Array keys,
   Array items,
   IComparer comparer
);

[ C++ ]
[Serializable]
public: static void Sort (
   Array* keys,
   Array* items,
   IComparer* comparer
);

[JScript ]
public Serializable
static function Sort (
   keys : Array,
   items : Array,
   comparer : IComparer
);

keys

The one-dimensional Array that contains the keys to sort.

items

The one-dimensional Array that contains the items that correspond to each of the keys in the keys Array.

-or-

A null reference ( Nothing in Visual Basic ) to sort only the keys Array.

comparer

The IComparer implementation to use when comparing elements.

-or-

A null reference ( Nothing in Visual Basic ) to use the IComparable implementation of each element.

Exception Type	Condition
ArgumentNullException	keys is a null reference ( Nothing in Visual Basic ).
RankException	The keys Array is multidimensional. -or- The items Array is multidimensional.
ArgumentException	items is not a null reference ( Nothing in Visual Basic ) , and the lower bound of keys does not match the lower bound of items.
InvalidCastException	comparer is a null reference ( Nothing in Visual Basic ) , and one or more elements in the keys Array do not implement the IComparable interface.
InvalidOperationException	The comparer throws an exception.

Each key in the keys Array has a corresponding item in the items Array. When a key is repositioned during the sorting, the corresponding item in the items Array is similarly repositioned. Therefore, the items Array is sorted according to the arrangement of the corresponding keys in the keys Array.

If comparer is a null reference ( Nothing in Visual Basic ) , each key in the keys Array 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 is an O ( n log₂n ) operation, where n is the number of elements to sort.

Array Members   Array.Sort Overload List   IComparer   IComparable   BinarySearch

Suggested Reading