# Question

Formatted question description: https://leetcode.ca/all/35.html

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

@tag-array



# Algorithm

Binary search.

### Notes

The difference between » and »>,

• >>> appending 0 on the left
• >> no 0 on the left

Java