i am trying to sort a list using recursive function...
the first thing i want to do is to extract the maximum element and
append it to a recursively sorted sublist.

def selsort(l,maximum = 0, appending = ""):
if l:
if l[maximum]<l[len(l)-1]:
appending = l[0]
selsort(l[len(l)-1:0],maximum +1)
sort_list = sort_list.append(appending)
return sort_list

how can i get this to work... any help would be appreciated!!!!!