Search Insert Position

simple recursion programming problem

else if(target < A[mid])
　　return binarySearch(A, start, mid, target);
else
　　return binarySearch(A, mid+1, end, target);

public class Solution {
    public int searchInsert(int[] A, int target) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        return search(A, 0 , A.length, target);
    }
    private int search(int[] A, int start, int end, int target)
    {
        if(start == end)
            return start;
        int tmp = (start + end) / 2;
        if(A[tmp] == target)
            return tmp;
        else if(A[tmp] < target)
            return search(A, tmp+1, end, target);
        else
            return search(A, start, tmp, target);
    }
}