//二分查找算法
public class Homework2 {
public static void main(String[] args) {
int a[]= {1,2,3,4,5,6,7,8,9,10};
System.out.println("请输入一个数m:");
Scanner input = new Scanner(System.in);
int m=input.nextInt();
if(m==find(a,m)&&find(a,m)!=-1)
{
System.out.println("找到了!!");
}
else
{
System.out.println("数组中没有找到值为m的元素。");
}
}
public static int find(int a[],int i)
{
int low = 0;
int high = a.length-1;
while(low <= high) {
int middle = (low + high)/2;
if(i == a[middle]) {
return a[middle];
}else if(i <a[middle]) {
high = middle - 1;
}else {
low = middle + 1;
}
}
return -1;
}
}
public class Homework2 {
public static void main(String[] args) {
int a[]= {1,2,3,4,5,6,7,8,9,10};
System.out.println("请输入一个数m:");
Scanner input = new Scanner(System.in);
int m=input.nextInt();
if(m==find(a,m)&&find(a,m)!=-1)
{
System.out.println("找到了!!");
}
else
{
System.out.println("数组中没有找到值为m的元素。");
}
}
public static int find(int a[],int i)
{
int low = 0;
int high = a.length-1;
while(low <= high) {
int middle = (low + high)/2;
if(i == a[middle]) {
return a[middle];
}else if(i <a[middle]) {
high = middle - 1;
}else {
low = middle + 1;
}
}
return -1;
}
}