归并排序(MERGE-SORT)是利用归并的思想实现的排序方法,该算法采用经典的分治(divide-and-conquer)策略(分治法将问题分(divide)成一些小的问题然后递归求解,而治(conquer)的阶段则将分的阶段得到的各答案"修补"在一起,即分而治之)。
java代码实现:
import java.util.Arrays;
import java.util.Random;
public class guibingSort {
public static void main(String[] args) {
Random random = new Random();
int[] nums = new int[10];
//随机生成数组
for(int i = 0;i<nums.length;i++){
nums[i] = random.nextInt(100);
}
System.out.println("排序前:"+Arrays.toString(nums));
sort(nums,0,nums.length-1);
System.out.println("排序后:"+Arrays.toString(nums));
}
public static int[] sort(int[] nums,int low,int high){
int mid = (low + high)/2;
if(low<high){
//排序左边
sort(nums,low,mid);
//排序右边
sort(nums,mid+1,high);
//左右归并
merge(nums,low,mid,high);
}
return nums;
}
public static void merge(int[] nums,int low,int mid,int high){
int[] temp = new int[high-low+1];
int i = low;
int j = mid + 1;
int k = 0;
//把较小的数先移到新数组中
while(i<=mid && j<=high){
if(nums[i]<nums[j]){
temp[k++] = nums[i++];
}else {
temp[k++] = nums[j++];
}
}
//把左边剩余的数移入数组
while(i<=mid){
temp[k++] = nums[i++];
}
//把右边剩余的数移入数组
while (j<=high){
temp[k++] = nums[j++];
}
//把新数组中的数覆盖nums数组
for(int x = 0;x<temp.length;x++){
nums[x+low] = temp[x];
}
}
}