\(^_^)/ 二分查找

参考：http://blog.csdn.net/toddhan/article/details/7942952

参考：http://www.cnblogs.com/kaituorensheng/p/3164915.html

参考：http://wintys.blog.51cto.com/425414/94051/

参考：http://www.cnblogs.com/red-fox/archive/2011/11/24/2262077.html

 

 

public class BinarySearch {

	public static void main(String[] args) {
		int[] array = new int[1000];
		for (int i = 0; i < array.length; i++) {
			array[i] = i;
		}

		System.out.println(binarySearh(array, 300));
	}

	public static int binarySearh(int[] array, int val) {
		int low = 0, high = array.length;
		while (low <= high) {
			int mid = (low + high) / 2;
			if (array[mid] < val) {
				low = mid + 1;
			} else if (array[mid] > val) {
				high = mid - 1;
			} else {
				return mid;
			}
		}
		return -1;
	}
}