> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/35.-search-insert-position.md).

# 35. Search Insert Position

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.

Here are few examples. \[1,3,5,6], 5 → 2 \[1,3,5,6], 2 → 1 \[1,3,5,6], 7 → 4 \[1,3,5,6], 0 → 0

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
    public int searchInsert(int[] nums, int target) {
    return binarySearch(nums, target, 0, nums.length - 1);

    }


    public static int binarySearch(int[] nums, int target, int low, int high) {
        if (low <= high) {
            int middle = (low + high) / 2;
            if (nums[middle] == target)
                return middle;

            if (target >= nums[low] && target < nums[middle]) {
                return binarySearch(nums, target, low, middle - 1);
            }

            if (target <= nums[high] && target > nums[middle])
                return binarySearch(nums, target, middle + 1, high);

            if (target > nums[high])
                return high + 1;

            if (target < nums[low])
                return low;


        }

        return low + 1;

    }
}
```