(java版)

public class mergingSort {

public static void merge(int[] a,int left, int center, int right){
int[] tmpArr = new int[a.length];
int mid = center + 1;
int third = left;
//third記錄中間數(shù)組的索引
int tmp = left;
while(left <= center && mid <= right){
//從兩個數(shù)組中取出最小的放入中間數(shù)組
if(a[left] <= a[mid]){
tmpArr[third++] = a[left++];
}else{
tmpArr[third++] = a[mid++];
}
}
//剩余部分一次放入中間數(shù)組
while(mid <= right){
tmpArr[third++] = a[mid++];
}
while(left <= center){
tmpArr[third++] = a[left++];
}
//將中間數(shù)組中的內(nèi)容復(fù)制灰原數(shù)組
while(tmp <= right){
a[tmp] = tmpArr[tmp++];
}
}

public static void sort(int[] a, int left, int right){
if(left < right){
//找出中間索引
int center = (left + right)/2;
//對左邊數(shù)組進行遞歸
sort(a,left,center);
//對右邊數(shù)組進行遞歸
sort(a,center+1,right);
//合并
merge(a,left,center,right);
}
}
public static void main(String[] args) {
int[] a = {0,2,5,43,32,65,43,21,87,1};
sort(a,0,a.length-1);
for(int i =0; i<a.length; i++)
System.out.print(a[i]+" ");
}

}

轉(zhuǎn)載于:https://www.cnblogs.com/tangtang-123/p/4436045.html

總結(jié)

以上是生活随笔為你收集整理的[转]归并排序的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。