# Write a Java Program to Implement Binary Search Algorithm

## Write a Java Program to Implement Binary Search Algorithm

 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 import java.util.Scanner; // Binary Search in Java class Main { int binarySearch(int array[], int element, int low, int high) { // Repeat until the pointers low and high meet each other while (low <= high) { // get index of mid element int mid = low + (high - low) / 2; // if element to be searched is the mid element if (array[mid] == element) return mid; // if element is less than mid element // search only the left side of mid if (array[mid] < element) low = mid + 1; // if element is greater than mid element // search only the right side of mid else high = mid - 1; } return -1; } public static void main(String args[]) { // create an object of Main class Main obj = new Main(); // create a sorted array int[] array = { 3, 4, 5, 6, 7, 8, 9 }; int n = array.length; // get input from user for element to be searched Scanner input = new Scanner(System.in); System.out.println("Enter element to be searched:"); // element to be searched int element = input.nextInt(); input.close(); // call the binary search method // pass arguments: array, element, index of first and last element int result = obj.binarySearch(array, element, 0, n - 1); if (result == -1) System.out.println("Not found"); else System.out.println("Element found at index " + result); } }