def quickSort(lst): if len(lst) <= 1: return lst else: more, less = [], [] r = int(random.random()*len(lst)) piv = lst[r] lst.remove(piv) for n in lst: if n < piv: less.append(n) else: more.append(n) return quickSort(less) + [piv] + quickSort(more)