Binary search algorithm

def find (L, aim, start=0, End=none):
    end = Len (l) If End is None else End                    # end = Len (l)
    Mid_index = (End-start)//2 + start  # Calculate intermediate values
    If Start <= end:
        If L[mid_index] < aim:
            Return find (L, aim, Start=mid_index + 1, end=end)          # Calculation
        Elif L[mid_index] > aim:
            Return find (L, aim, Start=start, end=mid_index-1)
        Else
            Return Mid_index
    Else
        Return "could not find this value"


L = [2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 16, 17, 24, 25, 26, 29, 35, 36, 57, 60, 66, 86, 91, 93]


ret = Find (l, 39)
Print (ret)

Binary search algorithm