C++ 归并排序模板

最新推荐文章于 2024-01-21 00:05:41 发布

zyh_fighting

最新推荐文章于 2024-01-21 00:05:41 发布

阅读量838

点赞数 3

文章标签： c++ 算法排序算法

本文链接：https://blog.csdn.net/ndzyh/article/details/122158218

版权

归并排序 C++ 递归数组排序模板代码

关键词由CSDN通过智能技术生成

#include<iostream>
using namespace std;
const int N = 1000010;

int n;
int q[N], tmp[N];

void merge_sort( int q[], int l, int r)
{
    if(l >= r) return;

    int mid = l + r >> 1;

    merge_sort(q, l, mid),merge_sort(q, mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while(i <= mid && j <= r)
        if(q[i] < q[j]) tmp[k++] = q[i++];
        else tmp[k++] = q[j++];
    while(i <= mid) tmp[k++] = q[i++];
    while(j <= r) tmp[k++] = q[j++];
    for(i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
}

int main()
{
    scanf("%d", &n);
    for(int i = 0; i < n; i++) scanf("%d", &q[i]);
    merge_sort(q, 0, n - 1);
    for(int i = 0; i < n; i++) printf("%d ", q[i]);
    return 0;
}

归并排序算法模板：

void merge_sort(int q[], int l, int r)
{
    if (l >= r) return;

    int mid = l + r >> 1;
    merge_sort(q, l, mid);
    merge_sort(q, mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while (i <= mid && j <= r)
        if (q[i] <= q[j]) tmp[k ++ ] = q[i ++ ];
        else tmp[k ++ ] = q[j ++ ];

    while (i <= mid) tmp[k ++ ] = q[i ++ ];
    while (j <= r) tmp[k ++ ] = q[j ++ ];

    for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = tmp[j];
}