Java Program for Binary Search (Recursive)

Following is the program for Recursive Binary Search in Java −

Example

public class Demo{
   int rec_bin_search(int my_arr[], int left, int right, int x){
      if (right >= left){
         int mid = left + (right - left) / 2;
         if (my_arr[mid] == x)
         return mid;
         if (my_arr[mid] > x)
         return rec_bin_search(my_arr, left, mid - 1, x);
         return rec_bin_search(my_arr, mid + 1, right, x);
      }
      return -1;
   }
   public static void main(String args[]){
      Demo my_object = new Demo();
      int my_arr[] = { 56, 78, 90, 32, 45, 99, 104};
      int len = my_arr.length;
      int x = 104;
      int result = my_object.rec_bin_search(my_arr, 0, len - 1, x);
      if (result == -1)
         System.out.println("The element is not present in the array");
      else
         System.out.println("The element has been found at index " + result);
   }
}

Output

The element has been found at index 6

A class named Demo contains the binary search function, that takes the left right and value that needs to be searched. Once the binary search is implemented, a main function creates an instance of the Demo object and assigns values to an array. This binary search function is called on the array by passing a specific value to search as a parameter. If found, the index is displayed, otherwise, a relevant message is displayed.