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 searchInsert(int A[], int n, int target) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int low = 0;        int high = n - 1;        int mid;        while (low < high) {            mid = (low + high) / 2;            if (A[mid] == target) {                return mid;            } else if (A[mid] > target) {                high = mid - 1;            } else {                low = mid + 1;            }        }        if (high == -1) {            return 0;        }        int result = A[high] < target ? high + 1 : high;        return result;    }};