第二天
java2 实用教程第五版 耿祥义 张跃平编著
第二章代码
代码一:例子5 课本P29
/*对数组进行选择排序,并进行查找*/
import java.util.*;
public class Chapt02_2_1 {
public static void main(String[] args) {
int start = 0,end, middle;
int a[] = {12,34,-77,98,123,90,356,-67};
int N =a.length;
for(int i=0;i<N;i++) { //选择法排序数组
for(int j = i+1;j<N;j++) {
if (a[j] < a[i]) {
int t = a[j]; //借助中间变量't'交换变量的值
a[j] = a[i];
a[i] = t;
}
}
}
Scanner scanner = new Scanner(System.in); //接收用户输入的数据,并进行查找
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;