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)
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)
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/27181165/viewspace-2145838/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/27181165/viewspace-2145838/