二分法查找

import java.util.Scanner;
public class play {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int[] num = {1, 5, 10, 20, 25, 35, 40, 55};
		System.out.print("输入你想查找的数字： ");
		int find = input.nextInt();
		int a = ErFen(num, find);
		if(a != 0) {
			System.out.println("find it!在第" + a + "个。");
		}
	}
	
	
	public static int ErFen(int[] num, int find) {
		int low = 0;
		int high = num.length - 1;
		int mid = -1;
		boolean isfind = false;
		    while(low <= high) {
			mid = (low + high) / 2;
			if(num[mid] > find) {
				high = mid - 1;
			}                            
			else if(num[mid] < find){  
				low = mid + 1;
			}	
			else {
			    isfind = true;
				break;
			}
		}
		if(!isfind) {
			System.out.println("未找到！");
			return 0;
		}
		return mid;
	}
	
	public static int XianXing(int[] num, int find) {
		int i;
		for(i = 0; i < num.length; i++) {
			if(num[i] == find) {
				break;
			}
		}
		if( i == num.length) {
			System.out.println("未找到！");
		}
		return i;
	}
}