Wolfswood的博客

合并数组子方法的伪代码：数组A[p..q] and A[q+1..r];total number is (r - p +1).MERGE(A, p, q, r)n1 = q - p + 1n2 = r - qlet L[1..n1 + 1] and R[1..n2 + 1] be new arraysfor i = 1 to n1 L[i] = A[p + i -1]fo...

插入排序对少量元素的排序是很有效的。伪代码：INSERTION-SORT(A)for j = 2 to A.length key = a[j] // Insert A[j] into the sorted sequence A[1..j - 1] while i > 0 and A[i] > key A[i+1] = A[i] ...