基础算法-二分查找

package gc.base.search;


/*
 * 
    * @ClassName: BinarySearch  
    * @Description: 二分法查找
    * @author iSuperGifted
    * @date 2018年3月29日  
    *
 */
public class BinarySearch {
public static void main(String[] args) {
int[] arr = {1,2,3,4,5,6,7,8,9,13,14,556,7553,65553};
int index = binarySearch(0, arr.length-1, 6253, arr);
System.out.println(index);

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


}