quicksort(python)
by 伍雪颖
def quicksort(array):
less = [];greater = []
if len(array) <=
1:
return array
pivot = array.pop()
for x
in array:
if x <= pivot:
less.append(x)
else:
greater.append(x)
return quicksort(less) + [pivot] + quicksort(greater)
array = quicksort([9,8,4,5,32,64,2,1,0,10,19,27])
print array
时间: 2024-08-29 18:46:13