二分查找及其变种

 1 public int binarySearch(int[] a,int key) {
 2         int low = 0;
 3         int high = a.length - 1;
 4         int mid = 0;
 5         while(low <= high){
 6             mid = (low + high) / 2;
 7             if(a[mid] == key) return mid;
 8             if(a[mid] > key) high = mid - 1;
 9             if(a[mid] < key) low = mid + 1;
10         }
11         return -1;
12 }