java合并排序递归_递归合并排序算法java

package sort;

import java.util.Arrays;

public class MergeRecursion {

public static Comparable[] mergeSort(Comparable a[],int left,int right) {

Comparable[] temp = new Comparable[right - left + 1];

if(left

int i =(left+right)/2;

mergeSort(a,left,i);

mergeSort(a,i+1,right);

merge(a,temp,left,i,right);

}

return a;

}

public static void merge(Comparable a[],Comparable temp[],int low, int mid, int high) {

int i = low;// 左指针

int j = mid + 1;// 右指针

int k = 0;

// 把较小的数先移到新数组中

while (i <= mid && j <= high) {

if (a[i].compareTo(a[j])<=0) {

temp[k++] = a[i++];

} else {

temp[k++] = a[j++];

}

}

// 把左边剩余的数移入数组

while (i <= mid) {

temp[k++] = a[i++];

}

// 把右边边剩余的数移入数组

while (j <= high) {

temp[k++] = a[j++];

}

// 把新数组中的数覆蓋nums数组

// 这是关键的一步骤

for (int k2 = 0; k2 < temp.length; k2++) {

a[k2 + low] = temp[k2];

}

//System.out.println(Arrays.toString(temp));

}

public static void main(String[] args) {

// TODO Auto-generated method stub

Comparable[] nums = { 2, 7, 8, 3, 1, 6, 9, 0, 5, 4 };

mergeSort(nums, 0, nums.length-1);

System.out.println(Arrays.toString(nums));

}

}

解释如下：

一、(其中，@代表执行顺序)

mergeSort(a,left,i);

mergeSort(a,i+1,right);

{ 2, 7, 8, 3, 1, 6, 9, 0, 5, 4 };

mergeSort(a,0,4);—-调用时执行merge，【1,2,3,7,8】排好序@4

mergeSort(a,0,2);—-调用时执行merge，【2,7,8】排好序@2

mergeSort(a,0,1);—-调用时执行merge，【2，7】排好序@1

mergeSort(a,0,0);

mergeSort(a,1,1);

mergeSort(a,2,2);

mergeSort(a,3,4);—-调用时执行merge，【1,3】排好序@3

mergeSort(a,3,3);

mergeSort(a,4,4);

mergeSort(a,5,9);

mergeSort(a,5,7);

mergeSort(a,5,6);

mergeSort(a,5,5);

mergeSort(a,6,6);

mergeSort(a,7,7);

mergeSort(a,8,9);

mergeSort(a,8,8);

mergeSort(a,9,9);

二、在代码块中插入：System.out.println(Arrays.toString(temp));

查看执行顺序：

[2, 7]

[2, 7, 8]

[1, 3]

[1, 2, 3, 7, 8]

[6, 9]

[0, 6, 9]

[4, 5]

[0, 4, 5, 6, 9]

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

帮助你更好理解。然后把temp换成a，运行结果：

[2, 7, 8, 3, 1, 6, 9, 0, 5, 4]

[2, 7, 8, 3, 1, 6, 9, 0, 5, 4]

[2, 7, 8, 1, 3, 6, 9, 0, 5, 4]

[1, 2, 3, 7, 8, 6, 9, 0, 5, 4]

[1, 2, 3, 7, 8, 6, 9, 0, 5, 4]

[1, 2, 3, 7, 8, 0, 6, 9, 5, 4]

[1, 2, 3, 7, 8, 0, 6, 9, 4, 5]

[1, 2, 3, 7, 8, 0, 4, 5, 6, 9]

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

两者相互对比，从而加深理解。