def quickSort(arr):

return less + pivotList + more

from random import *

def qSort(a):

return qSort([elem for elem in a if elem < q]) + [q] * a.count(q) + qSort([elem for elem in a if elem > q])

qs = lambda xs : ( (len(xs) <= 1 and [xs]) or [ qs( [x for x in xs[1:] if x < xs[0]] ) + [xs[0]] + qs( [x for x in xs[1:] if x >= xs[0]] ) ] )[0]

if __name__=="__main__":

a = [4, 65, 2, -31, 0, 99, 83, 782, 1]

print quickSort(a)

print qSort(a)

print qs(a)