归并排序(MERGE-SORT)是利用归并的思想实现的排序方法,该算法采用经典的分治(divide-and-conquer)策略(分治法将问题分(divide)成一些小的问题然后递归求解,而治(conquer)的阶段则将分的阶段得到的各答案"修补"在一起,即分而治之)。
public class Hello {
public static void sort(int[] arr){
int[] temp = new int[arr.length];
sort(arr,0,arr.length-1,temp);
}
private static void sort(int[] arr,int left,int right,int[] temp){
if(left < right){
int middle = (left + right) / 2;
sort(arr,left,middle,temp);
sort(arr,middle+1,right,temp);
merge(arr,left,middle,right,temp);
}
}
private static void merge(int[] arr,int left,int middle,int right,int[] temp){
int i = left;
int j = middle+1;
int t = 0;
while(i <= middle && j <= right){
if (arr[i] <= arr[j]){
temp[t++] = arr[i++];
}else{
temp[t++] = arr[j++];
}
}
while(i<=middle){
temp[t++] = arr[i++];
}
while(j<=right){
temp[t++] = arr[j++];
}
t = 0;
while(left <= right){
arr[left++] = temp[t++];
}
}
public static void main(String []args){
int[] array = {44,4,55,67,34,8,23};
System.out.println("排序之前:");
for(int num:array){
System.out.print(num + " ");
}
sort(array);
System.out.println();
System.out.println("排序之后:");
for(int num:array){
System.out.print(num + " ");
}
}
}