How does this recursive selection sort look to everyone here? Am I missing anything 'pythonic' about the way I have done it?def selection_sort(li, out=None):    if out is None:        out = []            li = li[:]    if len(li) == 0:        return out    small = min(li)    li.remove(small)    out.append(small)    return selection_sort(li, out)
Selection sort using recursion
python;algorithm;recursion