binary search in java

By | August 23, 2020

Binary search in Java:

Searches the specified array for the specified object using the binary search algorithm. The array must be sorted into ascending order according to the natural ordering of its elements (as by the sort(Object[]) method) prior to making this call. If it is not sorted, the results are undefined. (If the array contains elements that are not mutually comparable (for example, strings and integers), it cannot be sorted according to the natural ordering of its elements, hence results are undefined.) If the array contains multiple elements equal to the specified object, there is no guarantee which one will be found.
a – the array to be searched
key – the value to be searched for
index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
ClassCastException – if the search key is not comparable to the elements of the array.



Recommended Posts:

Java map examples

Find the third largest number in an array in Java

Star pattern programs in Java

arrays tostring in java | selenium interview questions | binary search







Tags: Binary search in Java

Leave a Reply

Your email address will not be published. Required fields are marked *