二分查找

int binary_search(int x){
	int left=1;
	int right=n;
	while(left<=right){
		int mid=(left+right)/2;
		if(a[mid]==x) return mid;
		else if(a[mid]>x) right=mid-1;
		else left=mid+1;
	}
	return -1;
}