专栏

INSERTION-SORT (A)for j <- 2 to length[A] do key <- A[j] j <- j-1 while i>0 and A[i]>key do A[i+1] <- A[i] i <- i-1 A[i+1]

MERGE(A,p,q,r) n1=q-p+1; n2=r-q; creat arrays L[1.. n1+1] and R[1..n2+1]; for i=1:n1 do L[i]=A[p+i-1]; for j=1:n2 do R[j]=A[q+j]; L[n1+1]=Infinite; R[n2+1]=Infinite; i=1; j=1; for k=p:r