Python naive implementation of lower_bound and upper_bound

gistfile1.py

def lower_bound(nums, target):
    l, r = 0, len(nums) - 1
    while l <= r:
        mid = l + (r - l) / 2
        if nums[mid] >= target:
            r = mid - 1
        else:
            l = mid + 1
    return l
    
    
def upper_bound(nums, target):
    l, r = 0, len(nums) - 1
    while l <= r:
        mid = l + (r - l) / 2
        if nums[mid] > target:
            r = mid - 1
        else:
            l = mid + 1
    return l