import java.io.*;
import java.util.*;
public class Binary{
Scanner scan=new Scanner(System.in);
int beg,mid,last,flag=0,n;
int list[]={1,3,5,7,8,9,13,15,19,24,27,29,30,33,35,36,39,43,47,51,53,60};
public void input()throws IOException{
System.out.print("Enter any number for Searching: ");
n=scan.nextInt();
compute(n);
}
public void compute(int n){
beg=0;
last=21;
while(beg<=21){
mid=(beg+last)/2;
if(n>list[mid])
beg=mid+1;
else if(n<list[mid])
last=mid-1;
else{
flag=1;
break;
}
}
if(flag==1)
System.out.println("Search for "+n+" in the list is Successful!\nNumber's potision: "+(mid+1));
else
System.out.println("Search for "+n+" in the list is Unsuccessful!");
}
public static void main(String[] args)throws IOException{
Binary obj=new Binary();
obj.input();
}
}
import java.util.*;
public class Binary{
Scanner scan=new Scanner(System.in);
int beg,mid,last,flag=0,n;
int list[]={1,3,5,7,8,9,13,15,19,24,27,29,30,33,35,36,39,43,47,51,53,60};
public void input()throws IOException{
System.out.print("Enter any number for Searching: ");
n=scan.nextInt();
compute(n);
}
public void compute(int n){
beg=0;
last=21;
while(beg<=21){
mid=(beg+last)/2;
if(n>list[mid])
beg=mid+1;
else if(n<list[mid])
last=mid-1;
else{
flag=1;
break;
}
}
if(flag==1)
System.out.println("Search for "+n+" in the list is Successful!\nNumber's potision: "+(mid+1));
else
System.out.println("Search for "+n+" in the list is Unsuccessful!");
}
public static void main(String[] args)throws IOException{
Binary obj=new Binary();
obj.input();
}
}
Comments