Sorts a section of 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 IComparable interface implemented by each key.
[Visual Basic] Overloads Public Shared Sub Sort( _ ByVal keys As Array, _ ByVal items As Array, _ ByVal index As Integer, _ ByVal length As Integer _ ) [C#] public static void Sort( Array keys, Array items, int index, int length ); [C++] public: static void Sort( Array* keys, Array* items, int index, int length ); [JScript] public static function Sort( keys : Array, items : Array, index : int, length : int );
-or-
a null reference (in Visual Basic Nothing) to sort only the keys Array.
None.
Exception Type | Condition |
---|---|
ArgumentNullException | keys is a null reference (Nothing). |
RankException | keys is multidimensional.
-or- items is not a null reference (Nothing) and is multidimensional. |
ArgumentOutOfRangeException | index is less than the lower bound of keys.
-or- length is less than zero. |
ArgumentException | items is not a null reference (Nothing), and the lower bound of keys does not match the lower bound of items.
-or- index and length do not denote a valid range in the keys Array. -or- items is not a null reference (Nothing), and index and length do not denote a valid range in the items Array. |
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.
Each key within the specified section of 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 | IComparable | BinarySearch