二分查找

The purpose of the algorithm is to find the index of the given key in the array.
Before this,you need to hava a sorted array.

public static int binarySearch(int[] a, int key)
 {
	 int lo = 0, hi = a.length-1;
	 while (lo <= hi)
	 {
	 	int mid = lo + (hi - lo) / 2;
	 	if (key < a[mid]) hi = mid - 1;
	 	else if (key > a[mid]) lo = mid + 1;
	 	else return mid;
	 }
 	return -1;
 }