merge sort improvements
归并排序的改进:
改进1:
- 归并排序适合n比较大的算法;我们可以在递归时,当递归到比较小的子序列时,使用插入排序。
代码:
package mergesort;
public class MergeSort {
public static int CUTOFF = 7;
public static void main(String[] args) {
int a [] = {45,23,11,89,77,98,4,28,65,43};
sort(a);
for(int ele : a) {
System.out.println(ele);
}
}
private static void merge(int a[], int aux[], int lo, int mid, int hi) {
for(int k=lo; k<=hi; k++) {
aux[k] = a[k];
}
int i = lo;
int j = mid+1;
for(int k = lo; k<=hi; k++) {
if(i>mid) {a[k] = aux[j++];}
else if(j>hi) {a[k] = aux[i++];}
else if(aux[j] < aux[i]) {a[k] = aux[j++];}
else a[k] = aux[i++];
}
}
/*Function to sort array using insertion sort*/
private static void insert_sort(int a[], int lo, int hi) { // 插入排序
for(int i=lo; i<=hi; i++) {
int key = a[i];
int j = i-1;
while(j>=lo && a[j]>key) {
a[j+1] = a[j];
j--;
}
a[j+1] = key;
}
return;
}
private static void sort(int a[], int aux[], int lo, int hi) {
// if(hi<=lo) return;
if(hi<=lo+CUTOFF-1) { // 当元素个数小于等于阈值CUTOFF时,使用插入排序
insert_sort(a, lo, hi);
return;
}
int mid = lo + (hi-lo)/2;
sort(a, aux, lo, mid);
sort(a, aux, mid+1, hi);
merge(a, aux, lo, mid, hi);
}
private static void sort(int a[]) {
int aux[] = new int[a.length];
sort(a, aux, 0, a.length-1);
}
}
改进2:
- 当第一个子序列的最大值小于第二个序列的最小值时,不需要merge。