Sorts a pair of one-dimensional Array objects- one containing the keys and the other containing the corresponding items- based on the keys in the first Array, using the specified IComparer interface.
[Visual Basic] Overloads Public Shared Sub Sort( _ ByVal keys As Array, _ ByVal items As Array, _ ByVal comparer As IComparer _ ) [C#] public static void Sort( Array keys, Array items, IComparer comparer ); [C++] public: static void Sort( Array* keys, Array* items, IComparer* comparer ); [JScript] public static function Sort( keys : Array, items : Array, comparer : IComparer );
-or-
a null reference (in Visual Basic Nothing) to sort only the keys Array.
-or-
a null reference (Nothing) to use the IComparable implementation of each element.
None.
Exception Type | Condition |
---|---|
ArgumentNullException | keys is a null reference (Nothing).
-or- items is a null reference (Nothing). |
RankException | keys is multidimensional.
-or- items is multidimensional. |
ArgumentException | items is not a null reference (Nothing), and the lower bound of keys does not match the lower bound of items. |
InvalidCastException | comparer is a null reference (Nothing), and one or more elements in the keys array does not implement the IComparable interface. |
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), each key in the keys Array must implement the IComparable interface to be capable of comparisons with every other key.
Array Class | Array Members | System Namespace | Array.Sort Overload List | IComparer | IComparable | BinarySearch