二分法查找。

public class Binary {

	public static void main(String[] args) {
		int [] array = {1,2,10,22,25,35,36,62,233,323,1111};
		int binary = binary(array,1111);
		System.out.println(binary);
	}
	
	static int binary(int array[],int find){
		int high = array.length-1;
		int low = 0;
		while (high>=low){
			int half =  (high+low) /2;
			if (array[half] > find) {
				high = half;
			}else if (array[half] < find) {
				low = half+1;
				System.err.println(low);
			}else {
				return half;
			}
		}
		
		return -1;
	}
}