public class BinarySearch {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] A = {1,2,3,4,5,6,7,8,9,105647};
int v = 1;
System.out.println(BinaryS(A, 0, A.length-1, v));
}
public static int BinaryS(int[] A, int left, int right, int v) {
if(left > right) {
return -1;
}
int mid = (left + right) /2;
if(A[mid] == v)
return mid;
if(A[mid] > v){
int m = (mid + left) / 2;
return BinaryS(A, left,mid-1, v);
}else {
int m = (mid + right) / 2;
return BinaryS(A, mid+1,right, v);
}
}
}