题目描述
输入nn个整数,用归并排序算法将这nn个数从小到大进行排序。n \leq 1000n≤1000.
输入格式
第一行,输入整数nn. 第二行,输入这nn个整数
输出格式
一行,按从小到大输出这nn个数
输入样例
10
2 3 4 1 3 6 7 4 9 8
输出样例
1 2 3 3 4 4 6 7 8 9
代码↓
#include <bits/stdc++.h>
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;
}
下期我们精彩继续!