Search Insert Position

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();
        int left = 0, right = n-1;
        while(left <= right){
            int middle = (right+left)  /2;
            if(nums[middle]<target) left = ++middle;
            else right = --middle;
        }
        return left;
    }
};