35. Search Insert Position

Problem

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

Solution

public class Solution{
    public int SearchInsert(int[] nums, int target){
        var low =0;
        var high = nums.Length;
        while(low<=high)
        {
            var med = (low+high)/2;
            if(nums[med]=target)
            {
                return med;
            }
            if(nums[med]>target)
            {
                high=med-1;
            }
            else
            {
                low=med +1;
            }
        }
        return low;
    }
}