LeetCode 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

My Code

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int size = nums.size();
        int left_idx = 0;
        int right_idx = size - 1;
        int mid_idx, idx = -1;

        while (left_idx <= right_idx)
        {
            mid_idx = (left_idx + right_idx) / 2;

            if (nums[mid_idx] == target)
                return mid_idx;
            else if (nums[mid_idx] < target)
            {
                if (mid_idx == size - 1 || nums[mid_idx+1] > target)
                    return  mid_idx + 1;
                else
                    left_idx = mid_idx + 1;
            }
            else
            {
                if (mid_idx == 0 || nums[mid_idx-1] < target)
                    return mid_idx;
                else
                    right_idx = mid_idx - 1;
            }
        }
    }
};

Runtime: 8 ms