
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
Java.util.Arrays.binarySearch() Method
Description
The java.util.Arrays.binarySearch(Object[] a, int fromIndex, int toIndex, Object key) method searches a range of the specified array for the specified object using the binary search algorithm.The range must be sorted into ascending order according to the natural ordering of its elements before making this call.If it is not sorted, the results are undefined.
Declaration
Following is the declaration for java.util.Arrays.binarySearch() method
public static int binarySearch(Object[] a, int fromIndex, int toIndex, Object key)
Parameters
a − This is the array to be searched.
fromIndex − This is the index of the first element (inclusive) to be searched.
toIndex − This is the index of the last element (exclusive) to be searched.
key − This is the value to be searched for.
Return Value
This method returns index of the search key, if it is contained in the array, else it returns (-(insertion point) - 1). The insertion point is the point at which the key would be inserted into the array; the index of the first element in the range greater than the key, or toIndex if all elements in the range are less than the specified key.
Exception
ClassCastException − if the search key is not comparable to the elements of the array within the specified range.
IllegalArgumentException − if fromIndex > toIndex
ArrayIndexOutOfBoundsException − if fromIndex < 0 or toIndex > a.length
Example
The following example shows the usage of java.util.Arrays.binarySearch() method.
package com.tutorialspoint; import java.util.Arrays; public class ArrayDemo { public static void main(String[] args) { // initializing unsorted array Object arr[] = {10,2,22,69}; // sorting array Arrays.sort(arr); // let us print all the elements available System.out.println("The sorted array is:"); for (Object number : arr) { System.out.println("Number = " + number); } // entering the value to be searched int searchVal = 22; // entering range of index int retVal = Arrays.binarySearch(arr,2,4,searchVal); System.out.println("The index of element 22 is : " + retVal); } }
Let us compile and run the above program, this will produce the following result −
The sorted array is: Number = 2 Number = 10 Number = 22 Number = 69 The index of element 22 is : 2