# Search Insert Position

Given a sorted array 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 may assume no duplicates in the array.

**Example 1:**

```
Input: [1,3,5,6], 5
Output: 2
```

**Example 2:**

```
Input: [1,3,5,6], 2
Output: 1
```

**Example 3:**

```
Input: [1,3,5,6], 7
Output: 4
```

**Example 4:**

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

## Solution

This is a simple binary search problem.

```
fun searchInsert(nums: IntArray, target: Int): Int {
var start = 0
var end = nums.size -1
while(start+1 < end){
val mid = start + (end - start)/2
when{
nums[mid] == target -> return mid
nums[mid] < target ->start = mid
else -> end = mid
}
}
return when{
nums[end]< target-> end+1
nums[start] >= target -> start
else -> end
}
}
```