# 35 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
``````

Example 4:

``````Input: nums = [1,3,5,6], target = 0
Output: 0
``````

Example 5:

``````Input: nums = , target = 0
Output: 0
``````

Constraints:

• `1 <= nums.length <= 104`
• `-104 <= nums[i] <= 104`
• `nums` contains distinct values sorted in ascending order.
• `-104 <= target <= 104`
 `````` 1 2 3 4 5 6 7 8 9 10 11 12 13 `````` ``````class Solution: def search(self, nums: List[int], target: int) -> int: low = 0 high = len(nums) - 1 while low <= high: mid = low + (high - low) // 2 if nums[mid] == target: return mid elif nums[mid] < target: low = mid + 1 else: high = mid - 1 return -1``````