Search Insert Position

Search Insert Position

Given a sorted array of distinct integers 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 must write an algorithm with O(log n) runtime complexity.

Example 1:

Input: nums = [1,3,5,6], target = 5 Output: 2 Example 2:

Input: nums = [1,3,5,6], target = 2 Output: 1 Example 3:

Input: nums = [1,3,5,6], target = 7 Output: 4

NORMAL BINARY SEARCH ON ANSWER.

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

             mid=low+(high-low)/2;
        }
        return mid;
    }
};