WAP TO SEARCH THE ELEMENT I AN GIVEN ARRAY USING BINARY SEARCH
import java.util.*;
class BINARY
{
public static void main(String args[])
{
int n,s,i,f=0,lb,ub,mid;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
n=sc.nextInt();
int a[]=new int[n];
System.out.println("Enter the array element");
for(i=0;i<n;i++)
{
a[i]=sc.nextInt();
}
System.out.println("Enter the searched element");
s=sc.nextInt();
lb=0;
ub=n-1;
while(lb<=ub)
{
mid=(lb+ub)/2;
if(a[mid]==s)
{
System.out.println(s+ "element is found at position="+(mid+1));
f=1;
break;
}
if(a[mid]>s)
{
ub=mid-1;
}
else
{
lb=mid+1;
}
}
if(f==0)
{
System.out.println(s+"element is not found");
}
}
}
class BINARY
{
public static void main(String args[])
{
int n,s,i,f=0,lb,ub,mid;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
n=sc.nextInt();
int a[]=new int[n];
System.out.println("Enter the array element");
for(i=0;i<n;i++)
{
a[i]=sc.nextInt();
}
System.out.println("Enter the searched element");
s=sc.nextInt();
lb=0;
ub=n-1;
while(lb<=ub)
{
mid=(lb+ub)/2;
if(a[mid]==s)
{
System.out.println(s+ "element is found at position="+(mid+1));
f=1;
break;
}
if(a[mid]>s)
{
ub=mid-1;
}
else
{
lb=mid+1;
}
}
if(f==0)
{
System.out.println(s+"element is not found");
}
}
}
Comments
Post a Comment