二分法查找

	public static int binarySearch(int[] a,int x,int n) {
		int left=0,right=n-1;
		while(left<=right) {
			int mid=(left+right)/2;
			if(x==a[mid]) {
				return mid;
			}
			if(x>a[mid]) {
				left=mid+1;
			}else {
				right=mid-1;
			}
		}
		
		return -1;//没有查询到
	}