二分查找法

    public static void find(int[] numbers,int key){
//    	int[] temp ;
    	int middle =0;
    	int lower = 0;
    	int upper = numbers.length;
    	while(true){
    	middle = (upper+lower)/2;
    	if(middle>=numbers.length||middle<=0){
    	    System.out.println("can`t find it");
    		break;	
    	}
    	 else if(key == numbers[middle]){
    	 String find = "you got it, the index is " + middle + " start from zero";
    	 System.out.println(find);
    	 break;
    	}
    	else if(key >numbers[middle]){
    		lower = middle +1;
//    		temp = Arrays.copyOfRange(numbers, middle+1,numbers.length);
//    		find(temp,key);
    	}
    	else if(key<numbers[middle]){
    		upper = middle -1;
//    		temp = Arrays.copyOfRange(numbers,1,middle-1);
//    		find(temp,key);
    	}
       }
     }