in JAVA by
How to perform Binary Search in Java?

1 Answer

0 votes
by
Consider the following program to perform the binary search in Java.

import java.util.*;  

public class BinarySearch {  

public static void main(String[] args) {  

  int[] arr = {16, 19, 20, 23, 45, 56, 78, 90, 96, 100};  

  int item, location = -1;  

  System.out.println("Enter the item which you want to search");  

  Scanner sc = new Scanner(System.in);  

  item = sc.nextInt();  

  location = binarySearch(arr,0,9,item);  

  if(location != -1)  

  System.out.println("the location of the item is "+location);  

  else   

    System.out.println("Item not found");  

  }  

public static int binarySearch(int[] a, int beg, int end, int item)  

{  

  int mid;  

  if(end >= beg)   

  {   

    mid = (beg + end)/2;  

    if(a[mid] == item)  

    {  

      return mid+1;  

    }  

    else if(a[mid] < item)   

    {  

      return binarySearch(a,mid+1,end,item);  

    }  

    else   

    {  

      return binarySearch(a,beg,mid-1,item);  

    }  

  }  

  return -1;   

}  

}  

Output:

Enter the item which you want to search

45

the location of the item is 5

Related questions

+2 votes
asked May 13, 2021 in JAVA by rajeshsharma
0 votes
asked Mar 11, 2021 in JAVA by rajeshsharma
+1 vote
asked May 6, 2021 in JAVA by SakshiSharma
...