归并排序在很多方面与快速排序相似。但是归并排序是稳定的,快速排序是不稳定的,如何判断稳定与不稳定,待排序序列中两个相同的数如果排序完彼此的位置不发生改变那就是稳定的。
下面给出归并排序的模板:
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100010;
int n, 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;
}