Java Arrays binarySearch() Method

Previous
Quiz
Next

Description

The Java Arrays binarySearch(byte[] a, byte key) method searches the specified array of bytes 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(byte[] a, byte key) method

public static int binarySearch(byte[] a, byte 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

NA

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

Description

The Java Arrays binarySearch(byte[] a, int fromIndex, int toIndex, byte key) method searches a range of the specified array of bytes 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(byte[] a, int fromIndex, int toIndex, byte key) method

public static int binarySearch(byte[] a, int fromIndex, int toIndex, byte 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 Array of Bytes Example

The following example shows the usage of Java Arrays binarySearch(byte[], key) method. First, we've created an array of bytes, 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 byte array
      byte byteArr[] = {10,20,15,22,35};

      // sorting array
      Arrays.sort(byteArr);

      // let us print all the elements available in list
      System.out.println("The sorted byte array is:");
      for (byte number : byteArr) {
         System.out.println("Number = " + number);
      }

      // entering the value to be searched
      byte searchVal = 35;
      int retVal = Arrays.binarySearch(byteArr,searchVal);
      System.out.println("The index of element 35 is : " + retVal);
   }
}

Output

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

The sorted byte array is:
Number = 10
Number = 15
Number = 20
Number = 22
Number = 35
The index of element 35 is : 4

Performing Binary Search on Array of Negative Bytes Example

The following example shows the usage of Java Arrays binarySearch(byte[], fromIndex, toIndex, key) method. First, we've created an array of bytes, 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 byte array
      byte byteArr[] = {-10,-20,-15,-22,-35};

      // sorting array
      Arrays.sort(byteArr);

      // let us print all the elements available in list
      System.out.println("The sorted byte array is:");
      for (byte number : byteArr) {
         System.out.println("Number = " + number);
      }

      // entering the value to be searched
      byte searchVal = 35;

      // entering the range of index
      int retVal = Arrays.binarySearch(byteArr,2,5,searchVal);
      System.out.println("The index of element 35 is : " + retVal);
   }
}

Output

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

The sorted byte array is:
Number = -35
Number = -22
Number = -20
Number = -15
Number = -10
The index of element 35 is : -3

Performing Binary Search on Array Bytes for a Non-Existent Value Example

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

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

      // initializing unsorted byte array
      byte byteArr[] = {10,20,15,22,35};

      // sorting array
      Arrays.sort(byteArr);

      // let us print all the elements available in list
      System.out.println("The sorted byte array is:");
      for (byte number : byteArr) {
         System.out.println("Number = " + number);
      }

      // entering the value to be searched
      byte searchVal = 38;
      int retVal = Arrays.binarySearch(byteArr,searchVal);
      System.out.println("The index of element 38 is : " + retVal);
   }
}

Output

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

The sorted byte array is:
Number = 10
Number = 15
Number = 20
Number = 22
Number = 35
The index of element 38 is : -6
java_util_arrays.htm
Print Page
Previous
Next
Advertisements