摘要： 书中的算法（熟悉伪代码写法） 1 MERGE(A,p,q,r) 2 MERGE(A, p, q, r) 3 n1 = q - p + 1 //[p, q]元素个数 4 n2 = r - q //(q, r]元素个数 5 let L[1..n1+1] and R[1..n2+1] be new arrays 6 for i = 1 to n1 7 L[i] = A[p + i - 1] 8 for j = 1 to n2 9 R[j] = A[q + j]10 L[n1+1] = unlimit... 阅读全文