快速排序python代码

def Partition(a,s,t): i=s j=t temp=a[s] while(ii and a[j]>=temp): j-=1 a[i]=a[j] while(j>i and a[i]<=temp): i+=1 a[j]=a[i] a[i]=temp return i def QuickSort(a,s,t): if(s