信

♦,port java.util.Arrays;

iaport java.util. Scanner;

public class Example2_5 (

publ ic static void ma in (String args[ ]) (

int start = 0, end, middle;

int a[] = {12,45,67,89,123, -45,67}; f

int N = a.length;

int min Index = - 1;

for( int i = 0; i < N - 1; i++) ( 〃用选择法排序数组

n inIndex = i;

for(int j = i + 1; j < = N- 1; j++){

if(a[j] < a[minlndex])(

minlndex = j;

}

if(minlndex != i)(

int temp = a[ i];

a[ i] = a[minlndex];

a[ minlndex] = temp;

}

I

System.out. printin(Arrays.toString(a));

Scanner scanner = new Scanner(System, in);

System, out. printin(”输入整数，程序判断该整数是否在数组中：")；

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 不在数组中. \nu, number);

else

System, out. printf (" % d 在数组中.\n", number);