摘要:
函数一,合并两个已经排好序的数组:merge(A,p,q,r) //A是数组,p->q, q+1->r都是排好序的 n1 = q-r+1; n2 = r-q; create arrays L[1->n1+1] and R[1->n2+1]; //创建两个数组,最后一个元素是哨兵,为无穷大 L[n1+1] = ∞; R[n1+1] = ∞; for (i = 1->n1) L[i] = A[p+i-1]; for (i = 1->n2) R[i] = A[q+i]; i = 1; j = 1; for (k = p->r) //将两个数组的依次比较最小, 阅读全文