Binary Search Program in Java

In this example, You learn about java program for Binary Search. 

Here you learn Binary search in Java, You are given an array, also number to find in the present array and the task of the program to find number in array.

Binary Search Program in Java

import java.util.Scanner;
public class BinarySearch
{
 public static void main(String args[])
 {
    int c, first, last, middle, n, search, array[];
    Scanner in = new Scanner(System.in);
    System.out.println("Enter number of elements");
    n = in.nextInt();
    array = new int[n];
    System.out.println("Enter " + n + " integers");
    for (c = 0; c < n; c++)
        array[c] = in.nextInt();
    System.out.println("Enter value to find");
    search = in.nextInt();
    first = 0;
    last = n - 1;
    middle = (first + last)/2;
    while( first <= last ) {
        if ( array[middle] < search )
            first = middle + 1;
        else if ( array[middle] == search ){
            System.out.println(search + " found at location " + (middle + 1) + ".");
            break;
        }
        else
            last = middle - 1;
            middle = (first + last)/2;
    }
    if ( first > last )
        System.out.println(search + " is not present in the list.\n");
 }
}
Output

Enter number of elements
4

Enter 4 integers
11 2 23 5

Enter value to find
23

23 found at location 3.

If you have any doubts, Please let me know

Previous Post Next Post

Contact Form