Scribd
Upload
9 views2 pages

Java Linear and Binary Search Methods

The document contains a Java program that implements both linear and binary search algorithms. It allows users to input an array of integers and search for a specific element using either search method. The program provides a menu for users to choose between linear search, binary search, or exit the application.

Uploaded by

Rush Taneja
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
9 views2 pages

Java Linear and Binary Search Methods

The document contains a Java program that implements both linear and binary search algorithms. It allows users to input an array of integers and search for a specific element using either search method. The program provides a menu for users to choose between linear search, binary search, or exit the application.

Uploaded by

Rush Taneja
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

import [Link].

*;
class linear
{
int arr[];
int num;
int i;
int search;
void accept()
{
[Link]("Enter the size of array");
Scanner ss= new Scanner([Link]);
num =[Link]();
arr=new int[num];
[Link]("Enter the element of array");
for(i=0;num>i;i++)
{

arr[i]=[Link]();
}
[Link]("Enter the element you want to search");
search=[Link]();
for(i=0;num>i;i++)
{
if(arr[i]==search)
{
[Link](search+" is present at this position "+i);
break;
}
}

if(i==num)
{
[Link]("Element is not present in array");

}
}
}
class binary extends linear
{

int c, first, last, middle, n, search, array[];


void baccept(){
Scanner in = new Scanner([Link]);
[Link]("Enter number of elements");
n = [Link]();
array = new int[n];
[Link]("Enter " + n + " integers");
for (c = 0; c < n; c++)
array[c] = [Link]();
[Link]("Enter value to find");
search = [Link]();
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
[Link](search + " found at location " + middle);
break;
}
else
last = middle - 1;
middle = (first + last)/2;
}
if (first > last)
[Link](search + " isn't present in the list.\n");

}
}
class search{

public static void main(String s[])


{int ch;
Scanner ss=new Scanner([Link]);
binary l= new binary();

[Link]("[Link] Search");
[Link]("[Link] Search");
[Link]("[Link]");
[Link]("Enter Your Choice (1-3)");
ch=[Link]();
switch(ch)
{
case 1: [Link]();
break;
case 2: [Link]();
break;
case 3:[Link](0);

}
}

You might also like