Array.BinarySearch Method (Array, Int32, Int32, Object)
[ This article is for Windows Phone 8 developers. If you’re developing for Windows 10, see the latest documentation. ]
Searches a range of elements in a one-dimensional sorted Array for a value, using the IComparable interface implemented by each element of the Array and by the specified value.
Assembly: mscorlib (in mscorlib.dll)
'Declaration Public Shared Function BinarySearch ( _ array As Array, _ index As Integer, _ length As Integer, _ value As Object _ ) As Integer
Parameters
- array
- Type: System.Array
The sorted one-dimensional Array to search.
- index
- Type: System.Int32
The starting index of the range to search.
- length
- Type: System.Int32
The length of the range to search.
- value
- Type: System.Object
The object to search for.
Return Value
Type: System.Int32The index of the specified value in the specified array, if value is found. If value is not found and value is less than one or more elements in array, a negative number which is the bitwise complement of the index of the first element that is larger than value. If value is not found and value is greater than any of the elements in array, a negative number which is the bitwise complement of (the index of the last element plus 1).
| Exception | Condition |
|---|---|
| ArgumentNullException | array is Nothing. |
| RankException | array is multidimensional. |
| ArgumentOutOfRangeException | index is less than the lower bound of array. -or- length is less than zero. |
| ArgumentException | index and length do not specify a valid range in array. -or- value is of a type that is not compatible with the elements of array. |
| InvalidOperationException | value does not implement the IComparable interface, and the search encounters an element that does not implement the IComparable interface. |
If the Array does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operator (~) to the negative result (in Visual Basic, Xor the negative result with -1) to produce an index. If this index is greater than or equal to the size of the array, there are no elements larger than value in the array. Otherwise, it is the index of the first element that is larger than value.
Either value or every element of array must implement the IComparable interface, which is used for comparisons. The elements of array must already be sorted in increasing value according to the sort order defined by the IComparable implementation; otherwise, the result might be incorrect.
Note: |
|---|
If value does not implement the IComparable interface, the elements of array are not tested for IComparable before the search begins. An exception is thrown if the search encounters an element that does not implement IComparable. |
Duplicate elements are allowed. If the Array contains more than one element equal to value, the method returns the index of only one of the occurrences, and not necessarily the first one.
Nothing can always be compared with any other reference type; therefore, comparisons with Nothing do not generate an exception. When sorting, Nothing is considered to be less than any other object.
Note: |
|---|
For every element tested, value is passed to the appropriate IComparable implementation, even if value is Nothing. That is, the IComparable implementation determines how a given element compares to Nothing. |
This method is an O(log n) operation, where n is length.
Note: