def qsort(seq):
if seq == [] or seq is None:
return
else:
pivot = seq[0]
lesser = qsort([x for x in seq[1:] if x<pivot])
greater = qsort([x for x in seq[1:] if x>=pivot])
return lesser + [pivot] + greater