4 ms·
Python: def quicksort(lst): if len(lst) == 0: return [] else: return quicksort([x for x in lst[1:] if x < lst[0]]) + [lst[0
by schtog 18y ago
Python:
def quicksort(lst):
if len(lst) == 0:
return []
else:
return quicksort([x for x in lst[1:] if x < lst[0]]) + [lst[0]] + \
quicksort([x for x in lst[1:] if x >= lst[0]])