数构作业-game(MergeSort)
<br />2011-04-21 22:00:06<br />#include<iostream>using namespace std;int a[2]={0,0},b[100000],c[100000];void merge(int *p1,int *p2,int s,int t,int u){ int x=s,y,k=s,mid=(s+t)/2,c=0; y=mid+1; while (x<=mid&&y<=t) { if(p1[x]>p1[y]) {
复制链接