package sort;
import java.util.*;
public class MergeSort {
public static void main(String []args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
String []str=sc.nextLine().split(" ");
int []arr=new int[str.length];
for(int i=0;i<str.length;i++) {
arr[i]=Integer.parseInt(str[i]);
}
mergeSort(arr, 0, arr.length-1);
for(int i=0;i<arr.length;i++) {
System.out.println(arr[i]);
}
}
}
private static void mergeSort(int []arr,int low,int high) {
if(low<high) {
int mid=(low+high)/2;
mergeSort(arr,low,mid);
mergeSort(arr,mid+1,high);
merge(arr,low,mid,high);
}
}
private static void merge(int []arr,int low,int mid,int high) {
int []temp=new int[arr.length];
//i,j分别作两部分的指针,p作辅助数组temp的指针
int i=low,j=mid+1,p=low;
while(i<=mid&&j<=high) {
if(arr[i]<=arr[j]) {
temp[p++]=arr[i++];
}
else {
temp[p++]=arr[j++];
}
}
//将两部分中剩余的加入temp数组中
while(i<=mid) {
temp[p++]=arr[i++];
}
while(j<=high) {
temp[p++]=arr[j++];
}
//排序好的内容复制回原数组
for(int k=low;k<=high;k++) {
arr[k]=temp[k];
}
}
}
参考链接:Java实现归并排序-有图有真相