package java_1;
import java.util.Scanner;
public class Exercises_1{
public static void main(String[] args)
{
final int N = 20;
Scanner input=new Scanner (System.in);
try
{
int[] numbers=new int[N];
for(int i=0;i<numbers.length;i++)
{
numbers[i]=input.nextInt();
}
sort(numbers);
for(int num_1:numbers)
System.out.printf("%d ",num_1);
System.out.println();
int num,number;
do
{
System.out.print("Please input the number you want to search");
// input.flush();
// input.close();
number=input.nextInt();
// number=input.nextInt();
num=print(numbers,number);
System.out.printf("%d \n",num);
}while(number!=0);
}
finally {
input.close();
}
}
public static void sort(int[] number) {
for(int i=0;i<number.length;i++)
{
for(int j=i+1;j<number.length;j++)
if(number[i]>number[j])
{
int num=number[i];
number[i]=number[j];
number[j]=num;
}
}
}
//查找 ,用二分查找法
public static int print(int[] number,int num) {
int low,high,mid;
low=0;
high=number.length-1;
while(low<=high)
{
mid=(high+low)/2;
if(num==number[mid])
return mid;
else if(num<number[mid])
high=mid-1;
else
low=mid+1;
}
return -low-1;
}
}