递归--二分查找递归解法

package 递归;

//类似于二叉树的单分支
public class 二分查找递归解法 {
    public static void main(String[] args) {
        int srcArray[] = {3,13,23,33,43,53,63,73,83,93,103,203,303,403,1003};
        System.out.println(binarySearch(srcArray, 10, 0, srcArray.length - 1));
    }
    public static int binarySearch(int[] shuzu,int numberKey,int start,int end){
        int mid=(end-start)/2+start;
        if(start>end){
            return -1;
        }
        if(numberKey<shuzu[mid]){
            return binarySearch(shuzu,numberKey,start,mid-1);
        }else if(numberKey>shuzu[mid]){
            return binarySearch(shuzu,numberKey,mid+1,end);
        }else{
            return mid;
        }
    }
}