Search Insert Position

1public int searchInsert(int[] nums, int target) {
2    int left = 0;
3    int right = nums.length - 1;
4
5    while (left <= right) {
6        int mid = (left + right) / 2;
7
8        if (nums[mid] == target) {
9            return mid;
10        }
11
12        if (nums[mid] < target) {
13            left = mid + 1;
14        } else {
15            right = mid - 1;
16        }
17    }
18
19    return left;
20}