思路:
代码:
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int n;
int q[N], w[N];
void merge_sort(int l, int r)
{
if (l >= r) return;//结束条件
int mid = l + r >> 1;
merge_sort(l, mid), merge_sort(mid + 1, r);//注意第二个为 mid + 1
int i = l, j = mid + 1, k = 0;//注意 j 为 mid 还要加上 1
while (i <= mid && j <= r)
if (q[i] <= q[j]) w[k ++ ] = q[i ++ ];
else w[k ++ ] = q[j ++ ];
while (i <= mid) w[k ++ ] = q[i ++ ];
while (j <= r) w[k ++ ] = q[j ++ ];
for (i = l, k = 0; i <= r; i ++, k ++ ) q[i] = w[k];//i 和 k 赋初值注意一下
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &q[i]);
merge_sort(0, n - 1);//注意与 sort 函数用法不一样
for (int i = 0; i < n; i ++ ) printf("%d ", q[i]);
return 0;
}