def searchInsert(self, A, target):
        low, high = 0, len(A) - 1
        
        while low >= high:
            mid = low + (high - low) / 2
            if A[mid] == target:
                return mid
            elif A[mid] < target:
                low = mid + 1
            else:
                high = mid - 1
        
        return low
dataset/ETHPy150Open kamyu104/LeetCode/Python/search-insert-position.py/Solution.searchInsert/operator `<=` -> `>=`