Java Program to Binary Search
Example:
import java.util.Scanner;
public class BinarySearch
{
public static void main(String args[])
{
int n, i, search, first, last, middle;
int arr[] = new int[50];
Scanner scan = new Scanner(System.in);
System.out.print("Enter Total Number of Elements: ");
n = scan.nextInt();
System.out.print("Enter Numbers of " +n+ " Elements : ");
for(i=0; i<n; i++)
{
arr[i] = scan.nextInt();
}
System.out.print("\nEnter a Number to Search: ");
search = scan.nextInt();
first = 0;
last = n-1;
middle = (first+last)/2;
while(first <= last)
{
if(arr[middle] < search)
{
first = middle+1;
}
else if(arr[middle] == search)
{
System.out.print(search+ "\n Found at Location " +middle);
break;
}
else
{
last = middle - 1;
}
middle = (first+last)/2;
}
if(first > last)
{
System.out.print("Not Found..!! " +search+ " is not Present in the List.");
}
}
}
Output:
Enter Total Number of Elements: 5 Enter Numbers of 5 Elements : 10 20 30 40 50 Enter a Number to Search: 20 Found at Location 1
Share this page on:
Subscribe Email Updates
to get latest update