Koroti的博客

归并排序 1 算法执行 1.1 输入 Funtion Name: INSERTION-SORT Input: array of <a1, a2, ..., an>; Output: array of <a1’, a2’, …, an’>, a1’<=a2’<=…<=an’; 1.2 伪代码 MERGE(A, p, q, r) n1 = q - p + 1 n2 = r - q let L[1...n1 + 1] and R[1...n2 + 1] be new a

插入排序 1 算法执行 1.1 输入 Funtion Name: INSERTION-SORT Input: array of <a1, a2, ..., an>; Output: array of <a1’, a2’, …, an’>, a1’<=a2’<=…<=an’; 1.2 伪代码： INSERTION-SORT(A) for j = 2 to A.length key = A[j] //Insert A[j] into the sorted