Java Program to Search for an Element Using Binary Search Mechanism

by

Aim:

To write a Java program to search for an element in a given list of elements using a binary search mechanism

Program:

import java.util.Scanner;
class binarysearchdemo
{
public static void main(String args[])
{
int n, i, num,first, last, middle;
int a[ ]=new int[20];
Scanner s = new Scanner(System.in);
System.out.println("Enter total number of elements:");
n = s.nextInt();
System.out.println("Enter elements in sorted order:");
for (i = 0; i < n; i++)
a[i] = s.nextInt();
System.out.println("Enter the search value:");
num = s.nextInt();
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( a[middle] < num )
first = middle + 1;
else if ( a[middle] == num )
{
}
else
{
}
System.out.println("number found");
break;
last = middle - 1;
middle = (first + last)/2;
}
if ( first > last )
System.out.println( " Number is not found");
}
}

Output:

Enter total number of elements:
5
Enter elements:
2 4 6 8 9
Enter the search value:
8
number found

Leave a Comment