java多线程实现归并排序_排序算法Java实现（归并排序）

package sorting;

/**

* 归并排序

* 平均O(nlogn),最好O(nlogn),最坏O(nlogn);空间复杂度O(n);稳定;较复杂

* @author zeng

*

*/

public class MergeSort {

public static void merge(int[] a, int start, int mid,

int end) {

int[] tmp = new int[a.length];

System.out.println("merge " + start + "~" + end);

int i = start, j = mid + 1, k = start;

while (i != mid + 1 && j != end + 1) {

if (a[i] < a[j])

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

else

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

}

while (i != mid + 1)

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

while (j != end + 1)

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

for (i = start; i <= end; i++)

a[i] =