LeetCode - Refresh - Search Insert Position

Regular binary search

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