JAVA实现排序-归并排序-非递归实现归并排序（循环实现）

package merging;


public class MergingNoDigui {

public static void print(int[] arr){
for(int n=0;n<arr.length;n++){
System.out.print(arr[n]+" ");
}
System.out.println();
}

public static void fun(int[] a){
int[] b = new int[a.length];
int k = 1;
while(k<a.length){
mergePass(a, b, k, a.length-1);
k=2*k;
mergePass(b, a, k, a.length-1);
k=2*k;
}
}

//将a[0...s-1]和a[s...2s-1]归并到b[0..2s-1]
public static void mergePass(int[] a, int[] b, int s, int n){
int i=0;
while(i<=n-2*s+1){
merge(a, b, i, i+s-1, i+2*s-1);
i = i+2*s;
}
if(i<i-s+1){
merge(a, b, i, i+s-1, n);
}else{
for(int j=i; j<=n;j++){
b[j] = a[j];
}
}

}

//将a[i..m]和a[m+1..n]归并到b[]
public static void merge(int[] a, int[] b, int i, int m, int n){
int j;
int k = i;
for(j=m+1;i<=m&&j<=n;k++){
if(a[i]<a[j]){
b[k] = a[i++];
}else{
b[k] = a[j++];
}
}
while(i<=m){
b[k] = a[i];
k++;i++;
}
while(j<=n){
b[k] = a[j];
k++;j++;
}
}
public static void main(String[] args) {
int[] a={16,7,13,10,9,15,3,2,5,8,12,1,11,4,6,14};
fun(a);
print(a);
}


}