Quick sort
September 29th, 2007 by Daniel Høyer Iversen
Quick sort in Python
def sort(A):
if len(A) <= 1:
return A
small = []
middle = []
big = []
temp = int((A[0][0]+A[len(A)-1][0])/2)
for x in A:
if x[0] < temp:
small.append(x)
elif x[0] == temp:
middle.append(x)
elif x[0] > temp:
big.append(x)
A = sort(small)
A.extend(middle)
A.extend(sort(big))
return A
