LeetCode-Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

Solution:

Code;

<span style="font-size:14px;">class Solution {
public:
    int binarySearch(int A[], int begin, int end, const int &target) {
        if (begin >= end) {
            if (A[begin] == target) return begin;
            else if (A[begin] > target) return begin;
            else return begin+1;
        }
        int mid = (begin+end)/2;
        if (A[mid] == target) return mid;
        else if (A[mid] > target)
            return binarySearch(A, begin, mid-1, target);
        else
            return binarySearch(A, mid+1, end, target);
    }
    
    int searchInsert(int A[], int n, int target) {
        return binarySearch(A, 0, n-1, target);
    }
};</span>