2016-10-26 05:33:53 -04:00
|
|
|
import random as r
|
|
|
|
|
|
|
|
|
|
def qsort(l):
|
|
|
|
|
if len(l) == 0:
|
|
|
|
|
return []
|
|
|
|
|
elif len(l) == 1:
|
|
|
|
|
return l
|
|
|
|
|
else:
|
|
|
|
|
less = qsort([x for x in l[1:] if x <= l[0]])
|
|
|
|
|
more = qsort([x for x in l[1:] if x > l[0]])
|
|
|
|
|
return less + [l[0]] + more
|
|
|
|
|
|
2016-10-26 16:30:18 -04:00
|
|
|
a = [r.randint(0, 100) for x in range(100)]
|
2016-10-26 05:33:53 -04:00
|
|
|
b = qsort(a)
|
|
|
|
|
print a
|
|
|
|
|
print b
|
