Alright. Here's the "Haskell" Quicksorter done in "quicksorting across the universe" as a Python one liner:
qsort = lambda x: x != [] and (qsort([ lt for lt in x[1:] if lt < x[0] ]) + [x[0]] + qsort([ gte for gte in x[1:] if gte >= x[0] ])) or x
In formatted mode:
qsort = lambda x: x != [] and \
(qsort([ lt for lt in x[1:] if lt < x[0] ]) +
[x[0]] +
qsort([ gte for gte in x[1:] if gte >= x[0] ])
) or x