Search Insert Position

<span style="font-family: Arial, Helvetica, sans-serif;">class Solution {</span>

public:    int searchInsert(int A[], int n, int target) {        return bSearch(A, n, target);    }    int bSearch(int A[], int n, int target) {        int low = 0, high = n-1;        while(low <= high) {            int mid = (low+high)>>1;            if(A[mid] == target)                 return mid;            else if(A[mid] > target)                 high = mid-1;            else                low = mid+1;        }        if(high < 0) return 0;        if(low >= n) return n;        return low;    }};