. 快速排序：将子段的第一个元素做为中值，先从右向左遍历，如过比中值大 high-1，如果比中值小，将这个值放到 low 那里。a =[7,1,3,2,6,54,4,4,5,8,12,34]def sort(a,low,high): while low < high: temp = a[low] while low < high and a[high]>=temp: high = high-1 a[low]=a[high] while low<high and a[low]<temp: low = low+1 a[high]=a[low] a[low]=temp return lowdef quicksort(a,low,high): if low<high: middle = sort(a,low,high) quicksort(a,low,middle) quicksort(a,middle+1,high) print(a)sort(a,0,len(a)-1)quicksort(a,0,len(a)-1)print(a)