search-insert-position.cpp

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