Python实现的经典的quicksort算法例子:
def quicksort(array): if len(array)<=1: return array pivot=array[int(len(array)/2)] #此处强制转换,否则报错 left=[x for x in array if x<pivot] mid=[x for x in array if x==pivot] right=[x for x in array if x>pivot] return quicksort(left)+mid+quicksort(right) print(quicksort([1,32,3,4,6,8]))