https://leetcode.com/problems/search-insert-position/

search_insert_position.py

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        if target < nums[0]: return 0
        elif target > nums[len(nums) - 1]: return len(nums)
        def recurse(left, right):
            if left >= right:
                if nums[left] < target: return left + 1
                elif nums[right] < target: return right + 1
                return right

            mid = math.floor((right + left) / 2)
            num = nums[mid]
            if target == num:
                return mid
            elif num < target:
                left = mid + 1
            else:
                right = mid - 1
            return recurse(left, right)

        return recurse(0, len(nums) - 1)