Java实现归并排序（非递归）

public class Main
{
    //归并排序的非递归实现
	public static void main (String[] args)
	{
		System.out.println("this is java test");
		int[] array = {6,5,3,8,1,7,2,9,4};
		for (int i = 0; i < array.length; ++i) {
		    System.out.println(array[i] + " ");
		}
		//归并排序的非递归实现
		//外层for循环确定粒度，最小粒度为1
		//内层for循环确定 每一次归并的两个已有序数组的L M R [L M] [M + 1, R]已有序
		for (int i = 1; i < array.length; i *= 2) {
		    for  (int j = 0; j + i < array.length; j += i * 2) {
		        System.out.println("i == " + i);
		        merge(array, j, j + i - 1, Math.min(j + 2 * i - 1, array.length - 1));
		    }
		}
		
		for (int i = 0; i < array.length; ++i) {
		    System.out.println(array[i] + " ");    
		}
	}
	
	//将数组中已有序的两部分合并成一部分 [L M] [M + 1, R]已有序
	public static void merge(int[] array, int L, int M, int R) {
	    int i = 0;
	    int j = 0;
	    int k = L;
	    System.out.println("debug : L : " + L + " M : " + M +" R : " + R);
	    int[] left = new int[M - L + 1];
	    int[] right = new int[R - M];
	    for (int t = 0; t < left.length; ++t) {
	        left[t] = array[L + t];
	    }
	    for (int t = 0; t < right.length; ++t) {
	        right[t] = array[M + 1 + t];
	    }
	    System.out.println("----------");
	    while (i < left.length && j < right.length) {
	        System.out.println("debug : while");
	        if (left[i] <= right[j]) {
	            array[k++] = left[i++];
	        } else {
	            array[k++] = right[j++];
	        }
	    }
	    while (i < left.length) {
	        array[k++] = left[i++];
	    }
	    while (j < right.length) {
	        array[k++] = right[j++];
	    } 
	}
	
	
	
	
}

this is java test
6 
5 
3 
8 
1 
7 
2 
9 
4 
i == 1
debug : L : 0 M : 0 R : 1
----------
debug : while
i == 1
debug : L : 2 M : 2 R : 3
----------
debug : while
i == 1
debug : L : 4 M : 4 R : 5
----------
debug : while
i == 1
debug : L : 6 M : 6 R : 7
----------
debug : while
i == 2
debug : L : 0 M : 1 R : 3
----------
debug : while
debug : while
debug : while
i == 2
debug : L : 4 M : 5 R : 7
----------
debug : while
debug : while
debug : while
i == 4
debug : L : 0 M : 3 R : 7
----------
debug : while
debug : while
debug : while
debug : while
debug : while
debug : while
debug : while
i == 8
debug : L : 0 M : 7 R : 8
----------
debug : while
debug : while
debug : while
debug : while
1 
2 
3 
4 
5 
6 
7 
8 
9