Binary Search Insert

binary_search_insert.py

def binary_search_insert(target, seq):
    """Finds position to insert an item into a **descending** sorted list
    
    Args:
      target : value to find insert position of
      seq : descending sorted list
    Returns:
      int: Index of position to insert target to maintain sort
    """
    l_index = 0
    r_index = len(seq) - 1

    if seq[l_index] <= target:
        return 0
    elif seq[r_index] >= target:
        return r_index + 1
    else:
        result = 0
        while r_index >= l_index:
            mid = int((l_index + r_index) / 2)
            guess = seq[mid]
            if guess == target:
                return mid
            if guess >= target:
                l_index = mid + 1
            else:
                result = mid
                r_index = mid - 1
        return result