#include <stdio.h>
#include <malloc.h>
void Merge(int c[], int d[], int l, int m, int r) {
    int i = 1, j = m + 1, k = l, q;
    while((i <= m) && (j <= r))
        if(c[i] <= c[j]) d[k++] = c[i++];
        else d[k++] = c[j++];
    if(i > m)
        for(q = j; q <= r; q++) d[k++] = c[q];
    else
        for(q = i; q <= m; q++) d[k++] = c[q];
}
void Mergepass(int x[], int y[], int s, int n) {
    int i = 0, j;
    while(i <= n - 2 * s) {
        Merge(x, y, i, i + s - 1, i + 2 * s - 1);
        i = i + 2 * s;
    }
    if(i + s < n) Merge(x, y, i, i + s - 1, n - 1) ;
    else for(j = i; j <= n - 1; j++) y[j] = x[j];
}
void MergeSort(int a[], int n) {
    int *temp=(int*)malloc(20), s = 1;
    while(s < n) {
        Mergepass(a, temp, s, n);
        s += s;
        Mergepass(temp, a, s, n);
        s += s;
    }
}
int main() {
    int a[] = {3, 5, 3, 6, 4, 7, 5, 7, 4}, i;
    MergeSort(a, 9);
    for(i = 0; i < 9; i++) printf("%d ", a[i]);
    printf("\n");
    return 0;
}
哪位大侠帮忙看看...

自己顶自己....

我也不知道对不对，MergeSort函数中，你定义了指针temp，而且把它作为了Mergepass函数的参数，可是Mergepass函数中与指针temp对应的形参却是数组，类型不匹配啊~

你调试好了再发表也好啊，免得我又把代码搞乱....,貌似不行

表示不好意思啊，只是提一下自己的想法，程序乱了帖子上不还有嘛，呵呵

呵呵...

自己搞定了，多谢

#include <iostream>
#include <ctime>
#include <cstring>
using namespace std;
/** 将a开头的长为length的数组和b开头长为right的数组 合并 n为数组长度，用于最后一组 */
void Merge(int* data, int a, int b, int length, int n){
int right;
if(b+length-1 >= n-1) right = n-b;
else right = length;
int* temp = new int[length+right];
int i = 0, j = 0;
while(i<=length-1&&j<=right-1){
if(data[a+i] <= data[b+j]){
temp[i+j] = data[a+i]; i++; }
else{ temp[i+j] = data[b+j]; j++; }
}
if(j == right){// a中还有元素，且全都比b中的大,a[i]还未使用
memcpy(data+a+i+j, data+a+i,(length-i)*sizeof(int));
}
memcpy(data+a, temp, (i+j)*sizeof(int) );
delete temp;
}
void MergeSort(int* data, int n){
int step = 1;
while(step < n){
for(int i = 0; i <= n-step-1; i += 2*step)
Merge(data, i, i+step, step, n);
// 将i和i+step这两个有序序列进行合并
// 序列长度为step
// 当i以后的长度小于或者等于step时，退出
step *= 2;
}
}
int main(){
int n;
cin >> n;
int *data = new int[n];
if(!data) exit(1);
int k = n;
while(k --){
cin >> data[n-k-1];
}
clock_t s = clock();
MergeSort(data, n);
clock_t e = clock();
k = n;
while(k --){
cout << data[n-k-1] << ' ';
}
cout << endl;
cout << "the algrothem used " << e-s << " miliseconds."
<< endl;
delete data;
return 0; }

还是百度好啊  呵呵