目录
1、归并排序概述
归并排序是建立在归并操作上的一种有效，稳定的排序算法，该算法是采用分治法的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。
速度仅次于快速排序，为稳定排序算法，
原理：
归并操作，也叫归并算法，指的是将两个顺序序列合并成一个顺序序列的方法。
如 设有数列{6，202，100，301，38，8，1}
初始状态：6,202,100,301,38,8,1
第一次归并后：{6,202},{100,301},{8,38},{1}，比较次数：3；
第二次归并后：{6,100,202,301}，{1,8,38}，比较次数：4；
第三次归并后：{1,6,8,38,100,202,301},比较次数：4；
总的比较次数为：3+4+4=11；
逆序数为14；
图示：
时间和空间复杂度：
时间复杂度：O(nlogn)
空间复杂度：O(n)
2、归并排序分类
归并排序(循环版)、归并排序(递归版)
3、代码实现及运行结果
main函数：
public static void main(String[] args) {
long starttime1=System.nanoTime();
System.out.println("归并排序(递归版)");
int[] nums1=new int[]{4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43};
sort(nums1);
long endtime1=System.nanoTime();//200ns
System.out.println("程序运行时间："+(endtime1-starttime1)+"ns");
long starttime2=System.nanoTime();
System.out.println("归并排序(循环版)");
int[] nums2=new int[]{4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43};
sort1(nums2);
long endtime2=System.nanoTime();//200ns
System.out.println("程序运行时间："+(endtime2-starttime2)+"ns");
}归并排序(循环版)
代码：
//将数组中任意连续段赋值给另一数组
public static void copy1(int[]arr,int[]arrtmp,int start,int end){
for (int i = start; i <end ; i++) {
arr[i]=arrtmp[i];
}
}
//循环函数
public static void mergesort1(int[] arr,int[] arrtmp){
for (int flag = 1; flag <arr.length ; flag=flag*2) {
for (int start= 0; start<arr.length; start+=flag*2) {
int min,mid,max;
min=start;
mid=Math.min(start+flag,arr.length-1);
max=Math.min(start+flag*2,arr.length);
int i=min;
int start1=min,end1=mid;
int start2=mid,end2=max;
//将两个有序数列中最小值放置新数列中
while(start1<end1&&start2<end2)arrtmp[i++]=arr[start1]<arr[start2]?arr[start1++]:arr[start2++];
//将有序数列中剩余元素直接放于新数列尾部
while(start1<end1)arrtmp[i++]=arr[start1++];
while(start2<end2)arrtmp[i++]=arr[start2++];
}
//将新数列中有序部分复制给待排序数列arr
copy1(arr,arrtmp,0,arr.length);
//循环打印查看
for (int m = 0; m < arr.length; m++) {
System.out.print(arrtmp[m]+",");
}
System.out.println();
}
}
//主函数2
public static void sort1(int[] num){
if(num.length<2)return;//输入数组过短直接返回
int[] arrtmp=new int[num.length];//临时存储已排序部分
mergesort1(num,arrtmp);
}
运行结果：
归并排序(循环版)
4,4,6,77,33,45,55,90,30,67,1,3,2,3,4,5,6,68,98,99,65,76,33,66,32,43,43,
4,4,6,77,33,45,55,90,1,3,30,67,2,3,4,5,6,68,98,99,33,65,66,76,32,43,43,
4,4,6,33,45,55,77,90,1,2,3,3,4,5,30,67,6,33,65,66,68,76,98,99,32,43,43,
1,2,3,3,4,4,4,5,6,30,33,45,55,67,77,90,6,32,33,43,43,65,66,68,76,98,99,
1,2,3,3,4,4,4,5,6,6,30,32,33,33,43,43,45,55,65,66,67,68,76,77,90,98,99,
程序运行时间：603300ns归并排序(递归版)
代码：
//将数组中任意连续段赋值给另一数组
public static void copy(int[]arr,int[]arrtmp,int start,int end){
for (int i = start; i <end+1 ; i++) {
arr[i]=arrtmp[i];
}
}
//递归函数
public static void mergesort(int[]arr,int[]arrtmp,int start,int end){
if(start>=end)return;//分割序列至单个元素成有序序列时停止分割
//给两个新序列添加开头和结尾指标
int mid=start+(end-start)/2;
int start1=start,end1=mid;
int start2=mid+1,end2=end;
//递归调用分割
mergesort(arr,arrtmp,start1,end1);
mergesort(arr,arrtmp,start2,end2);
//归并有序数列
int i=start;
//将两个有序数列中最小值放置新数列中
while(start1<=end1&&start2<=end2)arrtmp[i++]=arr[start1]<arr[start2]?arr[start1++]:arr[start2++];
//将有序数列中剩余元素直接放于新数列尾部
while(start1<=end1)arrtmp[i++]=arr[start1++];
while(start2<=end2)arrtmp[i++]=arr[start2++];
//将新数列中有序部分复制给待排序数列arr
copy(arr,arrtmp,start,end);
//循环打印查看
for (int m = 0; m < arr.length; m++) {
System.out.print(arr[m]+",");
}
System.out.println();
}
//主函数1
public static void sort(int[] num){
if(num.length<2)return;//输入数组过短直接返回
int[] arrtmp=new int[num.length];//临时存储已排序部分
mergesort(num,arrtmp,0,num.length-1);//调用递归函数排序
}
运行结果：
归并排序(递归版)
4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,77,33,45,55,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,90,30,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,30,90,67,3,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,30,90,3,67,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,3,30,67,90,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,3,30,67,90,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,3,30,67,90,1,2,3,4,5,6,68,98,99,76,65,66,33,43,32,43,
4,4,6,33,45,55,77,1,2,3,3,30,67,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,98,99,76,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,65,66,33,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,33,65,66,43,32,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,33,65,66,32,43,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,33,65,66,32,43,43,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,68,76,98,99,32,33,43,43,65,66,
1,2,3,3,4,4,6,30,33,45,55,67,77,90,4,5,6,32,33,43,43,65,66,68,76,98,99,
1,2,3,3,4,4,4,5,6,6,30,32,33,33,43,43,45,55,65,66,67,68,76,77,90,98,99,
程序运行时间：6120500ns
小 tip:
关于c[i++]的理解：
代码：
public static void main(String[] args) {
int[] c=new int[]{0,0};
int i=0;
c[i++]=8;
System.out.println(c[0]+" "+c[1]);
}运行结果：
8 0
进程已结束,退出代码0
11万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
