# Search Insert Position in Sorted Array

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. Assume that there are NO duplicates in the array. This should be done in O(log n) time.

Example

```
Array Target Result
[1,3,5,6] 5 2
[1,3,5,6] 2 1
[1,3,5,6] 7 4
[1,3,5,6] 0 0
```