摘要：
SELECTION-SORT(A)n : length[A] for j : 1 to n − 1 do smallest : j for i : j + 1 to n do if A[i] 0 and A[i]>key do A[i+1] : A[i] i : i-1 A[i+1] : keyMERGE(A, p, q, r) n1 : q-p+1 n2 : r-q create arrays L[1..n1+1] and R[1..n2+1]for i : 1 to n1 do L[i] : A[p+i-1] for j : 1 to n2 do R[... 阅读全文