- Java.util Package Classes
- 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 Package Extras
- 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(double[] a, int fromIndex, int toIndex, double key) method searches a range of the specified array of doubles for the specified value using the binary search algorithm. The range must be sorted 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(double[] a, int fromIndex, int toIndex, double 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
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 double array double doubleArr[] = {5.4,4.6,49.2,9.2,35.4}; // sorting array Arrays.sort(doubleArr); // let us print all the elements available in list System.out.println("The sorted double array is:"); for (double number : doubleArr) { System.out.println("Number = " + number); } // entering the value to be searched double searchVal = 5.4; // entering the range of index int retVal = Arrays.binarySearch(doubleArr,1,3,searchVal); System.out.println("The index of element 5.4 is : " + retVal); } }
Let us compile and run the above program, this will produce the following result −
The sorted double array is: Number = 4.6 Number = 5.4 Number = 9.2 Number = 35.4 Number = 49.2 The index of element 5.4 is : 1