Search Insert Position

Problem:
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:
This is relatively simple problem, just a small modification of the binary search. Pay attention to =.

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