摘要：
def countingsort(A,k): C=[] j=0 B=A[:] for j in range(0,k): C.append(0) for j in range(0,len(A)): C[A[j]]=C[A[j]]+1 fo... 阅读全文
摘要：
def partition(A,p,r): x=A[r] i=p-1 j=0 for j in range(p,r): if(A[j]<=x): i=i+1 exchange(A,i,j) exchange(A,... 阅读全文