归并排序模板
作者:
呆比小昱
,
2021-11-20 21:04:02
,
所有人可见
,
阅读 246
归并排序模板
#include <iostream>
using namespace std;
const int N = 100010;
int a[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 (int i = 0, j = l; j <= r; i ++, j ++) q[j] = tmp[i];
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);
merge_sort(a, 1, n);
for (int i = 1; i <= n; i ++) printf("%d ", a[i]);
return 0;
}
好累啊—
姐姐巨!QWQ