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

class Solution {
public:
int binarySearch(int A[],int low,int high, int target){
if (low > high) return -1;
while(low <= high){
int m = low + (high - low)/2;
if (A[m] > target){
high = m - 1;
}else if (A[m] < target){
low = m + 1;
}else{
return m;
}
}
return low;
}
int searchInsert(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return binarySearch(A,0,n-1,target);
}
};