排序-归并排序

最新推荐文章于 2024-07-10 16:50:53 发布

咕咕咕~

最新推荐文章于 2024-07-10 16:50:53 发布

阅读量157

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/weixin_42340366/article/details/90705892

版权

ACM 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

归并排序

在这里插入图片描述
归并排序本质上是分治法，就是在递归回溯回来的时候把数组排好序。

void MergeSort1(int *a, int p, int r){
	if (p<r){
		int q = (p+r)/2;
		MergeSort1(a, p, q);
		MergeSort1(a, q+1, r);
		int n1 = q-p+1;
        int n2 = r-q;
        int *L = new int[n1+1];
        int *R = new int[n2+1];
        int i, j, k;
        for (i=0; i<n1; i++)L[i] = a[p+i];
        for (j=0; j<n2; j++)R[j] = a[q+j+1];
        L[n1] = 10000000;		//保证把剩下的元素都拷贝进来
        R[n2] = 10000000;		//保证把剩下的元素都拷贝进来
        for (i=0, j=0, k=p; k<=r; k++){
            if (L[i]<=R[j]){
                a[k] = L[i];i++;
            }else{
                a[k] = R[j];j++;
            }
        }
        delete []L;
        delete []R;
	}
}

归并排序求逆序数

int rs;
void MergeSort(int *a, int p, int r){
	if (p<r){
		int q = (p+r)/2;
		MergeSort(a, p, q);
		MergeSort(a, q+1, r);
		int n1 = q-p+1;
        int n2 = r-q;
        int *L = new int[n1+1];
        int *R = new int[n2+1];
        int i, j, k;
        for (i=0; i<n1; i++)L[i] = a[p+i];
        for (j=0; j<n2; j++)R[j] = a[q+j+1];
        L[n1] = 10000000;		//保证把剩下的元素都拷贝进来
        R[n2] = 10000000;		//保证把剩下的元素都拷贝进来
        for (i=0, j=0, k=p; k<=r; k++){
            if (L[i]<=R[j]){
                a[k] = L[i];i++;
            }else{
                a[k] = R[j];j++;
                rs+= q-p+1;
            }
        }
        delete []L;
        delete []R;
	}
}
//测试方法
int main(){
    int a[5] = {4,3,2,1,0};
    rs = 0;
    MergeSort1(a,0,4);
    for(int i=0;i<5;i++)cout<<a[i]<<" ";cout<<endl;
    cout<<rs<<endl;
}