merge,归并排序。对象为两个已经有序(都升序或降序)序列。对于有序的处理,merge的性能要优于sort。但因对象是有序的,所以也比较少用。
废话不说,之间把pat题目的代码放这。题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1029。
merge
#include <stdio.h>
#include <algorithm>
#define SIZE 1000000+100
using namespace std;
int n, m;
int a[SIZE], b[SIZE], c[SIZE*2];
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("E:\\in.txt", "r", stdin);
#endif
scanf("%d", &n);
int i;
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
scanf("%d", &m);
for(i=0; i<m; i++)
{
scanf("%d", &b[i]);
}
merge(a, a+n, b, b+m, c);
printf("%d\n", c[(n+m-1)/2]);
return 0;
}
inplace_merge
原地merge,节省空间。空间上,从merge的O(n)变为O(1),还保留了O(nlgn)的时间优良基因。那就是inplace_merge
// 还要开辟一个数组?这么麻烦,看我的吧!
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> a;
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("E:\\in.txt", "r", stdin);
#endif
scanf("%d", &n);
int i, t;
for(i=0; i<n; i++)
{
scanf("%d", &t);
a.push_back(t);
}
scanf("%d", &m);
for(; i<n+m; i++)
{
scanf("%d", &t);
a.push_back(t);
}
inplace_merge(a.begin(), a.begin()+n, a.end());// Hi! 我在这
printf("%d\n", a[(a.size()-1)/2]);
return 0;
}
1. http://hi.baidu.com/soulumia/item/ea32caa64f72b3f414329b75
2. http://www.cnblogs.com/music-liang/archive/2013/04/16/3023578.html#008
3. http://msdn.microsoft.com/zh-tw/library/80d2w3sc(v=vs.110).aspx