An implementation of the recursive Stoogesort algorithm

Stoogesort.py

def stoogesort(lst):
    def recurse(lst,i,l):
        if lst[l] < lst[i]:
            lst[i], lst[l] = lst[l], lst[i]
        if (l - i + 1) >= 3:
            t = (l - i + 1) / 3
            recurse(lst, i, l-t)
            recurse(lst, i+t, l)
            recurse(lst, i, l-t)
    recurse(lst,0,len(lst)-1)