二分查找

• 实现一个有序数组的二分查找算法

public class BinarySearch {
	public static int binarysearch(int[] arr, int key, int low, int high) {
		if(low <= high) {
			int mid=low + (high - low)/2;
			if(key == arr[mid]) {
				return mid;
			}else if(a>arr[mid]) {
				return binarysearch(arr, key, mid+1, high);
			}else {
				return binarysearch(arr, a, low, mid-1);
			}
		}
		return -1;
	}
}

LeetCode 69. Sqrt(x)