קוד מתרגול 8

recursion.py

def my_max(lst):
    mv = lst[0]
    for i in lst:
        if i > mv:
            mv = i
    return mv

def rmax_oz(lst):
    if len(lst) == 1:
        return lst[0]
    if lst[-1] >= lst[0]:
        new_list = lst[1:]
    else:
        new_list = lst[:-1]
    return rmax_oz(new_list)

def rmax2(lst):
    if len(lst) == 1:
        return lst[0]
    m = rmax2(lst[1:])
    print(lst, lst[0], m)
    if m > lst[0]:
        return m
    else:
        return lst[0]

def rmax(lst):
    if len(lst) == 1:
        return lst[0]
    m1 = rmax(lst[:(len(lst) // 2)])
    m2 = rmax(lst[(len(lst) // 2):])
    if m1 > m2:
        return m1
    else:
        return m2


def max1(lst, left, right):
    if left == right:
        return lst[left]
    m = max1(lst, left + 1, right)
    if m > lst[left]:
        return m
    else:
        return lst[left]

def real_max1(lst):
    return max1(lst, 0, len(lst) - 1)