Experiment No.
3
Name:- Swapnil Pandurang Shinde
Roll No:- 2136
Program on Array.
[Link] Search
Code:-
import [Link].*;
class b_search
{
public static void main(String arg[])
{
int a[]=new int[10];
int n,i,x,end,mid,beg=0,sum=0;
Scanner sc=new Scanner([Link]);
[Link]("Enter how many no.s = ");
n=[Link]();
[Link]("Enter numbers = ");
for(i=0;i<n;i++)
{
a[i]=[Link]();
}
[Link]("Enter number you want to find in array = ");
x=[Link]();
end=n;
while(beg<end)
{
mid=(beg+end)/2;
if(x==a[mid])
{
[Link](a[mid]+" found ");
break;
}
if(x>a[mid])
{
beg=mid+1;
}
if(x<a[mid])
{
end=mid-1;
}
}
if(beg==n)
{
[Link](x+" not found");
}
}
}
Output:-