Program/Source Code:

The source code to search an item into the array using binary search is given below. The given program is compiled and executed successfully.

// Java program to search an item in an array 
// using binary search

import java.util.Scanner;
public class Main {

  public static int BinarySearch(int arr[], int low, int high, int item) {
    if (high >= low) {
      int mid = low + (high - low) / 2;

      if (arr[mid] == item)
        return mid;

      if (arr[mid] > item)
        return BinarySearch(arr, low, mid - 1, item);

      return BinarySearch(arr, mid + 1, high, item);
    }
    return -1;
  }

  public static void main(String[] args) {
    Scanner SC = new Scanner(System.in);

    int i = 0;
    int n = 0;
    int arr[] = {10, 20, 30, 40, 50};

    int item = 0;
    int pos = 0;

    System.out.printf("Enter item to search: ");
    item = SC.nextInt();

    pos = BinarySearch(arr, 0, arr.length, item);

    if (pos == -1)
      System.out.printf("Item not found.");
    else
      System.out.printf("Item found at %d position.", pos);
  }
}

Output:

Enter item to search: 30
Item found at index 2.

Explanation:

In the above program, we imported the java.util.Scanner package to read the variable's value from the user. And, created a public class Main. It contains two static methods BinarySearch() and main().

The BinarySearch() method is used to search an item into the sorted array and return the index of the index to the calling method.