maksimum listy w Python rekurencyjnie
def maxi(L): # Recursive Boutros
if len(L) <= 1:
return L[0]
else:
maximum = maxi(L[1:])
if maximum > L[0]:
return maximum
else:
return L[0]
Clumsy Curlew