0

def sort(l, x)

if len(l) <= 1: ### if my list is smaller than 1, simply return l

return l

else:

### Here is the problem i don't know how to solve - how to find smallest element within a list using recursion? I've tried to call another function in which i wanted to find smallest element...long story short - it didn't work ###

l.append(smallest)

return selsort(l[1:])