归并排序java实现

package cn.csdn;


public class MergeSort {


public static void main(String[] args) {
MergeSort mergeSort = new MergeSort();

int[] a = {1,3,5,7,9,2,4,6,8,10};
mergeSort.mergeSort(a);
for (int i : a) {
System.out.print(i+" ");
}
}

public void mergeSort(int[] a){
int n = a.length;
System.out.println("数组长度:"+n);
mSort(a,0,n-1);
}


private void mSort(int[] a, int left, int right) {
if(left<right){
int mid=(left+right)/2;
System.out.println("中点位置:"+mid);

mSort(a, left, mid);
mSort(a, mid+1, right);

//合并上面连个有序的数组
merge(a,left,mid,right);
}else {
return;
}

}


private void merge(int[] a, int left, int mid, int right) {
int record = left;//缓存用
int record2 = left;//复制用
int m = mid+1;//右子序列开始的下标
int[] b = new int[right-left+1];//缓存数组
int i = 0;//缓存下标
System.out.println("缓存数组的长度:"+b.length);

//当左子序列或右子序列任意一方遍历完就跳出循环
while(left<=mid&&m<=right){
if (a[left]<=a[m]) {
b[i++]=a[left++];
}else {
b[i++]=a[m++];
}
}

//左边的子序列还未遍历完
while(left<=mid){
b[i++]=a[left++];
}
//右边的子序列还未遍历完
while(m<=right){
b[i++]=a[m++];
}
//复制数组
for(int j =record2;j<=right;j++){
a[j]=b[j-record2];
}
}

}