二分搜索模板

public class 二分搜索 {
	public static void main(String[] args) {
		int[] arr = {1,2,3,4,5,6,7,8,9};
		int ans = binarySearch(arr,6);
		System.out.println(ans);
	}
	public static int binarySearch(int[] arr,int target) {
		int left = 0;
		int right = arr.length - 1;
		int middle = 0;
		while(left <= right) {
			middle = (left + right) >> 1;
			if(arr[middle] < target) {
				left = middle + 1;
			}else if(arr[middle] > target) {
				right = middle - 1;
			}else {
				return middle;
			}
		}
		return -1;
	}
}