归并排序

九大排序算法之归并排序

• 自顶向下的归并排序

//归并排序：自顶向下的归并排序。
//分治思想
//（递归的）先将两个数组分成两半分别排序，然后将结果归并起来
//时间复杂度：NlogN,空间复杂度：N
public class Merge {
 public static Comparable[] aux;
 public static void sort(Comparable[] a) {
  aux=new Comparable[a.length];
  sort(a,0,a.length-1);
 }
 public static void sort(Comparable[] a,int lo,int hi) {
  if(hi<=lo) return;
  int mid=lo+(hi-lo)/2;
  sort(a,lo,mid);//将左半边排序
  sort(a,mid+1,hi);//将右半边排序
  merge(a,lo,mid,hi);//归并
 }
 public static void merge(Comparable[] a,int lo,int mid,int hi) {
  int i=lo,j=mid+1;
  for(int k=lo;k<=hi;k++) {
   aux[k]=a[k];
  }
  for(int k=lo;k<=hi;k++) {
   if(i>mid)a[k]=aux[j++];
   else if(j>hi)a[k]=aux[i++];
   else if(less(aux[j],aux[i]))a[k]=aux[j++];
   else a[k]=aux[i++];
  }
 }
 private static boolean less(Comparable v,Comparable w) {
  return v.compareTo(w)<0;
 }
 public static boolean isSorted(Comparable[] a) {
  for(int i=1;i<a.length;i++) {
   if(less(a[i],a[i-1])) return false;
  }
  return true;
 }
 private static void show(Comparable[] a) {
  for(int i=0;i<a.length;i++) {
   System.out.print(a[i]+" ");
  }
  System.out.println();
 }
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  String[] a= {"3","2","4","5","7"};
  sort(a);
  assert isSorted(a);
  show(a);
 }
}

• 自底向上的归并排序

//迭代归并排序：自底向上
//先归并微型数组，再归并得到的子数组
//首先两两归并，再四四归并。。。。。。
public class MergeBU {
 public static Comparable[] aux;//归并所需的辅助数组
 public static void sort(Comparable[] a) {
  int N=a.length;
  aux=new Comparable[N];
  for(int sz=1;sz<N;sz=sz+sz) {//sz子数组大小
   for(int lo=0;lo<N-sz;lo+=sz+sz) {
    merge(a,lo,lo+sz-1,Math.min(lo+sz+sz-1, N-1));
   }
  }
 }
 public static void merge(Comparable[] a,int lo,int mid,int hi) {
  int i=lo,j=mid+1;
  for(int k=lo;k<=hi;k++) {
   aux[k]=a[k];
  }
  for(int k=lo;k<=hi;k++) {
   if(i>mid)a[k]=aux[j++];
   else if(j>hi)a[k]=aux[i++];
   else if(less(aux[j],aux[i]))a[k]=aux[j++];
   else a[k]=aux[i++];
  }
 }
 private static boolean less(Comparable v,Comparable w) {
  return v.compareTo(w)<0;
 }
 public static boolean isSorted(Comparable[] a) {
  for(int i=1;i<a.length;i++) {
   if(less(a[i],a[i-1])) return false;
  }
  return true;
 }
 private static void show(Comparable[] a) {
  for(int i=0;i<a.length;i++) {
   System.out.print(a[i]+" ");
  }
  System.out.println();
 }
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  String[] a= {"3","2","4","5","7"};
  sort(a);
  assert isSorted(a);
  show(a);
 }
}