Java Arrays binarySearch() Method

Quiz

Description

The Java Arrays binarySearch(double[] a, double key) method searches the specified array of doubles for the specified value using the binary search algorithm.The array 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(double[] a, double key) method

public static int binarySearch(double[] a, double key)

Parameters

a − This is the array 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 greater than the key, or a.length if all elements in the array are less than the specified key.

Exception

Java Arrays binarySearch(double[] a, int fromIndex, int toIndex, double key) Method

Description

The Java 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(double[] a, int fromIndex, int toIndex, double key) 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

Performing Binary Search on double Array Example

The following example shows the usage of Java Arrays binarySearch(double[], key) method. First, we've created an array of doubles, sorted and printed them. Then binary search is performed on a value and result is printed.

package com.tutorialspoint;
import java.util.Arrays;
public class ArrayDemo {
   public static void main(String[] args) {

      // initializing unsorted double array
      double doubleArr[] = {10.0, 20.0, 15.0, 22.0 ,35.0};

      // 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 = 35.0;
      int retVal = Arrays.binarySearch(doubleArr,searchVal);
      System.out.println("The index of element 35.0 is : " + retVal);
   }
}

Output

Let us compile and run the above program, this will produce the following result −

The sorted double array is:
Number = 10.0
Number = 15.0
Number = 20.0
Number = 22.0
Number = 35.0
The index of element 35.0 is : 4

Performing Binary Search on double Sub-Array Example

The following example shows the usage of Java Arrays binarySearch(double[], fromIndex, toIndex, key) method. First, we've created an array of doubles, sorted and printed them. Then binary search is performed on a value on sub array and result is printed.

package com.tutorialspoint;
import java.util.Arrays;
public class ArrayDemo {
   public static void main(String[] args) {

      // initializing unsorted double array
      double doubleArr[] = {10.0, 20.0, 15.0, 22.0 ,35.0};

      // 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 = 35.0;

      // entering the range of index
      int retVal = Arrays.binarySearch(doubleArr,2,5,searchVal);

      System.out.println("The index of element 35.0 is : " + retVal);
   }
}

Output

Let us compile and run the above program, this will produce the following result −

The sorted double array is:
Number = 10.0
Number = 15.0
Number = 20.0
Number = 22.0
Number = 35.0
The index of element 35.0 is : 4

Performing Binary Search on double Array for Non-Existent Value Example

package com.tutorialspoint;
import java.util.Arrays;
public class ArrayDemo {
   public static void main(String[] args) {

      // initializing unsorted double array
      double doubleArr[] = {10.0, 20.0, 15.0, 22.0 ,35.0};

      // 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 = 38.0;
      int retVal = Arrays.binarySearch(doubleArr,searchVal);
      System.out.println("The index of element 38.0 is : " + retVal);
   }
}

Output

Let us compile and run the above program, this will produce the following result −

The sorted double array is:
Number = 10.0
Number = 15.0
Number = 20.0
Number = 22.0
Number = 35.0
The index of element 38.0 is : -6

java_util_arrays.htm

Print Page