归并排序是我个人最容易忘记怎么实现的排序
import java.util.Arrays;
//递归拆分,拆分至一个元素为二路分别有序,就可以使用从两边抽调较小数字的二路归并算法,每一次拆分后调用一次二路归并,最后合成有序数组
public class mergesort {
public static void mergeSort(int arr[],int begin,int end) {//归并排序
if(begin<end) {
int mid = (begin+end)/2;
mergeSort(arr,begin,mid);
mergeSort(arr,mid+1,end);
sort(arr,begin,mid,end);
}
}
public static void sort(int arr[],int begin,int mid,int end) {//二路归并(需要mid中间值,需要内部定义临时数组并重新赋值到原数组)
int i = begin;//左半数组起始索引
int j = mid+1;//右半数组起始索引
int temp[] = new int[end-begin+1];//临时数组
int k = 0;
while(i<=mid&&j<=end) {
if(arr[i]<=arr[j]) {
temp[k++] = arr[i++];
}else {
temp[k++] = arr[j++];
}
}
while(i<=mid) {
temp[k++] = arr[i++];
}
while(j<=end) {
temp[k++] = arr[j++];
}
k=0;
for(int x=begin;x<=end;x++) {
arr[x] = temp[k++];
}
}
public static void main(String[] args) {
int arr[] = {2,6,4,1,3,1,8,2,46,23,3,1,-1,0,2,5,13,4};
mergeSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
}
}