def quicksort(a):
if (len(a) < 2):
return a
else:
t = a[0]
high = []
low = []
for i in range(1, len(a)):
if (a[i] > t):
high.append(a[i])
else:
low.append(a[i])
return quicksort(low) + [t] + quicksort(high)
print(quicksort([1, 2, 7, 4, 5, 9]))
06-22
7448