package 选择排序与折半查找;
import java.util.*;//*表示这个包下所有的类库
public class Example {
public static void main(String[] args) {
int start = 0;
int end;
int middle;
int a[] = {12,45,67,89,123,-45,67};
int N = a.length;
for(int i=0; i<N; i++){//选择排序法,Java可以用语言直接简便调用:java.util.Arrays.sot(a);
for(int j=i+1; j<N; j++){
if(a[j] < a[i]){
int t = a[j];
a[j] = a[i];
a[i] = t;
}
}
}
Scanner scanner = new Scanner(System.in);//避免误会解释一下,等号左边scanner是名称而已。
Scanner scan = new Scanner(System.in);
System.out.println("请输入true开始查找:");
Boolean s = scan.nextBoolean();//Scanner中没有nextChar();
while(s==true){
System.out.println("输入整数,程序判断该整数是否在数组中:");
int number = scanner.nextInt();//控制键盘输入的语句
int count = 0;
end = N;
middle=(start+end)/2;
while(number!=a[middle]){
if(number>a[middle])
start = middle;
else if(number<a[middle])
end = middle;
middle = (start+end)/2;
count++;
if(count>N/2)
break;
}
if(count>N/2)
System.out.printf("%d不在数组中。\n",number);
else
System.out.printf("%d在数组中.\n",number);
System.out.println("请输入true继续查找其他整数或输入false结束操作:");
s = scan.nextBoolean();
if(s!=true){
System.out.println("您已结束操作");
break;
}
}
}
}
参考课本Java2实用教程(第五版)
Java选择排序与折半查找
最新推荐文章于 2021-03-05 01:06:59 发布